Optimal Parallelization Of Loop Structures
DOI:
https://doi.org/10.24297/ijct.v15i7.3974Keywords:
Loop Structures, Parallel Computing, Optimal ParallelizationAbstract
This paper is intended to be a follow up of the work done by the authors in previous articles. On one hand it is concluded with a theorem that proves to be a definite answer to one very important research direction and on the other hand it is an opening of new research directions in the field of loop structures automatic parallelization.Downloads
References
[1] Ciaca, M., Mocean L., Vancea A., 2013. Analisys of Data dependence. Applications in groups of firms, International
Conference on Informatics in Economy, Bucharest 2013, pp. 202-209, ISBN 2284-7472
[2] Ciaca, M., Mocean L., Vancea A., 2014. Loop Restruturing Transformations for Automatic Programs Paralelization, The
13th International Conference on Informatics in Economy, Bucharest University of Economic Studies Press, pg8-14
[3] Mocean, L., Ciaca M., Vancea A, 2013. Possibilities of parallel processing at the level of economic programs in groups
of firms, International Conference on Informatics in Economy, Bucharest 2013, pp. 31-36, ISBN 2284-7472
[4] Mocean, L., Ciaca M., Vancea A., 2014. Substitution transformations of loop iterations, The 13th International
Conference on Informatics in Economy, Bucharest University of Economic Studies Press, pg.94-97
[5] Vancea, A. 1997. Loop scheduling optimality for parallel execution, in Studia Informatica, vol.XLII, no.2, pp.25 - 32.
[6] Aiken, A. and A.Nicolau, 1988. Optimal loop parallelization, in Proceedings of the SIGPLAN Conference on
Programming Language Design and Implementation, Atlanta, Georgia, June 1988, SIGPLAN Notices 23, 7, July 1988,
pp.308-317.
[7] Cytron,R.1986. Doacross: Beyond vectorization for multiprocessors, in Proceedings of the 1985 International
Conference on Parallel Processing, Penn State University, August 1986, pp.836-844.
[8] Padua, D. and Wolfe,M. 1986, Advanced compiler optimizations for supercomputers, in Communications of ACM, 29,
1986, pp.1184-1201.
[9]H.M.Su and P.C Yew - Efficient Doacross Execution on Distributed Shared-Memory Multiprocessors, in Proceedings of
the ACM Conference on Supercomputing, November 18-22, 1991, Albuquerque, New Mexico, pp.842-853.
[10] Garey,M. and Johnson,D. 1979. Computers and Intractability , A guide to the theory of NP-completeness, Freeman,
New York, 1979.
[11] Brunet,S., Andronache,V. and Nelson, L. Passos Ranette Halverson , 2009. Performance Evaluation of Parallel
Implementation of Nested Loop Control Structures
[12]Darte, A. Parallelism Detection in Nested Loops, Optimal Encyclopedia of Parallel Computing, 2011, pp 1429-1442
[13]Weijia Sang et al., 1991. On loop transformations for generalized cycle shrinking, 1991 International Conference on
Parallel Processing
[14] Adam, T., K.Chandy and J.Dickson, 1974. A comparison of list schedules for parallel processing systems, in
Communications of the ACM, 17, pp.685-696.
Conference on Informatics in Economy, Bucharest 2013, pp. 202-209, ISBN 2284-7472
[2] Ciaca, M., Mocean L., Vancea A., 2014. Loop Restruturing Transformations for Automatic Programs Paralelization, The
13th International Conference on Informatics in Economy, Bucharest University of Economic Studies Press, pg8-14
[3] Mocean, L., Ciaca M., Vancea A, 2013. Possibilities of parallel processing at the level of economic programs in groups
of firms, International Conference on Informatics in Economy, Bucharest 2013, pp. 31-36, ISBN 2284-7472
[4] Mocean, L., Ciaca M., Vancea A., 2014. Substitution transformations of loop iterations, The 13th International
Conference on Informatics in Economy, Bucharest University of Economic Studies Press, pg.94-97
[5] Vancea, A. 1997. Loop scheduling optimality for parallel execution, in Studia Informatica, vol.XLII, no.2, pp.25 - 32.
[6] Aiken, A. and A.Nicolau, 1988. Optimal loop parallelization, in Proceedings of the SIGPLAN Conference on
Programming Language Design and Implementation, Atlanta, Georgia, June 1988, SIGPLAN Notices 23, 7, July 1988,
pp.308-317.
[7] Cytron,R.1986. Doacross: Beyond vectorization for multiprocessors, in Proceedings of the 1985 International
Conference on Parallel Processing, Penn State University, August 1986, pp.836-844.
[8] Padua, D. and Wolfe,M. 1986, Advanced compiler optimizations for supercomputers, in Communications of ACM, 29,
1986, pp.1184-1201.
[9]H.M.Su and P.C Yew - Efficient Doacross Execution on Distributed Shared-Memory Multiprocessors, in Proceedings of
the ACM Conference on Supercomputing, November 18-22, 1991, Albuquerque, New Mexico, pp.842-853.
[10] Garey,M. and Johnson,D. 1979. Computers and Intractability , A guide to the theory of NP-completeness, Freeman,
New York, 1979.
[11] Brunet,S., Andronache,V. and Nelson, L. Passos Ranette Halverson , 2009. Performance Evaluation of Parallel
Implementation of Nested Loop Control Structures
[12]Darte, A. Parallelism Detection in Nested Loops, Optimal Encyclopedia of Parallel Computing, 2011, pp 1429-1442
[13]Weijia Sang et al., 1991. On loop transformations for generalized cycle shrinking, 1991 International Conference on
Parallel Processing
[14] Adam, T., K.Chandy and J.Dickson, 1974. A comparison of list schedules for parallel processing systems, in
Communications of the ACM, 17, pp.685-696.
Downloads
Published
2016-05-06
How to Cite
Ciaca, M.-I., Mocean, L., Vancea, A., & Avornicului, M. (2016). Optimal Parallelization Of Loop Structures. INTERNATIONAL JOURNAL OF COMPUTERS &Amp; TECHNOLOGY, 15(7), 6907–6913. https://doi.org/10.24297/ijct.v15i7.3974
Issue
Section
Research Articles
