Abstract
A technique and its modification to execute in parallel perfectly and imperfectly nested loops with linear dependencies are considered. The technique obliges that firstly, all the loop iterations are executed in parallel. Then, the ends of pairs of dependent iterations are re-executed serially in lexicographical order. With the modified technique, first, all independent iterations and the iterations that are the beginnings of pairs of dependent ones are executed in parallel. Then, the iterations that are the ends of those are executed serially. Possibilities of implementing the technique and its modification by means of the Omega calculator are presented. Experimental results and future research are considered.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bacon, D., Graham S., Sharp O.: Compiler Transformation for High-Performance Computing. Computing Surveys, 26(4) (December, 1994) 345–420
Shen Z., Li Z., Yew P.-C.: An Empirical Study on Array Subscripts and Data Dependences. Proceedings of the International Conference on Parallel Processing, (1989) II-145–II-152
Lim A.W., Lam S.: Maximizing Parallelism and Minimizing Synchronization with AffineTransformations. Parallel Computing, 24(3–4) (May, 1998) 445–475
Wolfe M.: High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company (1995)
Ramanujam J.: Non-Singular Transformations of Nested Loops. In Supercomputing 92 (1992) 214–223
Feautrier P.: Some efficient solutions to the affine scheduling problem, II, multidimensional time. Int. J. of Parallel Programming, (December, 1992) 21(6):389–420
Rauchwerger L., Padua D.: The Privatizing Doall Test: A Run-Time Technique for Doall Loop Identification and Array Privatization. In Proc. of the 1994 International Conf. on Supercomputing (July, 1994) 33–43
Banerjee U.: Dependence Analysis for Supercomputing. Kluwer Academic Publishers (1988)
Li Z., Yew P., Zhu C.: An Efficient Data Dependence Analysis for Parallelizing Compilers. IEEE Trans. Parallel Distributed Systems, 1(1) (1990) 26–34
Wolfe M. Tseng Chau-Wen: The Power Test for Data Dependence. IEEE Trans. Parallel Distributed Systems, 3(5) (1992) 591–601
Gregory R.I., Krishnamurthy E.V.: Methods and Applications of Error-Free Computation. Springer-Verlag (1984)
Pugh, W., The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis. Comm. ACM 8, (1992) 102–114
Quilleré F., Rajopadhye., S. and Wilde D. Generation of Efficient Nested Loops from Polyhedra. International Journal of Parallel Programming, vol 28, 5 (October, 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beletskyy, V. (2002). A Technique for Parallel Loop Execution. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_39
Download citation
DOI: https://doi.org/10.1007/3-540-48051-X_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43786-4
Online ISBN: 978-3-540-48051-8
eBook Packages: Springer Book Archive