Abstract
Several loop transformations techniques have been designed to extract parallelism from nested loop structures. We first review two important approaches, known as Generalized Cycle Shrinking presented by Shang, O'Keefe and Fortes and the Index Shift Method introduced by Liu, Ho and Sheu. The main result of the paper is a new methodology that permits to combine cycle shrinking techniques with the index shift method. We present a new optimization method that produces the best scheduling vector, and we show that we can outperform previous results by an arbitrary speedup factor.
Supported by the Project C3 of the French Council for Research CNRS, and by the ESPRIT Basic Research Action 3280 “NANA” of the European Economic Community. Part of this work has been done while the first author was visiting IME/USP in July 1991. Support from the BID/USP is gratefully acknowledged.
Supported by the Program BID/USP (Interamerican Development Bank/University of São Paulo) - Project. 30.01, FAPESP (Fundação de Amparo à Pesquisa do Estado de São Paulo) - Proc. No. 88/3095-9 and CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico) - Proc. No. 306063/88-3.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
U. Banerjee, “An introduction to a formal theory of dependence analysis”, The Journal of Supercomputing 2, 1988, pp. 133–149.
A. Darte and Y. Robert, Scheduling uniform loop nests, Technical Report LIP-IMAG 92-10, Ecole Normale Supérieure de Lyon, February 1992.
M.L. Dowling, “Optimal code parallelization using unimodular transformations”, Parallel Computing, 16, 1990, pp. 157–171.
C.E. Leiserson and J.B. Saxe, “Optimizing synchronous systems”, Journal of VLSI Computer Systems, Vol. 1, April, 1983, pp. 41–67.
L.S. Liu, C.W. Ho, and J.P. Sheu, “On the parallelism of nested for-loops using index shift method”, Proceedings of International Conference on Parallel Processing, August 1990, pp. 11-119–11-123.
J.K. Peir and R. Cytron, “Minimum distance: a method for partitioning recurrences for multiprocessors”, IEEE Transactions on Computers, Vol. 38, No. 8, August 1989, pp. 1203–1211.
C.D. Polychronopoulos, “Compiler optimization for enhancing parallelism and their impact on architecture design”, IEEE Transactions on Computers, Vol. 37, No. 8, August 1988, pp. 991–1004.
C.D. Polychronopoulos, Parallel Programming and Compilers, Kluwer Academic Publishers, Boston, 1988.
Y. Robert and S.W. Song, Revisiting cycle shrinking, Technical Report LIP-IMAG 91–31, Ecole Normale Supérieure de Lyon, September 1991.
W. Shang and J.A.B. Fortes, “Time optimal linear schedules for algorithms with uniform dependences”, Proceedings of International Conference on Systolic Arrays, May 1988, pp. 393–402.
W. Shang and J.A.B. Fortes, “Time optimal linear schedules for algorithms with uniform dependencies”, IEEE Transactions on Computers, Vol. 40, No. 6, June 1991, pp. 723–742.
W. Shang, M.T. O'Keefe, J.A.B. Fortes, “On loop transformations for generalized cycle shrinking”, Proceedings of International Conference on Parallel Processing, August 1991, pp. II-132–II-141.
M. Wolfe, Optimizing Supercompilers for Supercomputers, MIT Press, Cambridge MA, 1989.
M. Wolfe, “Data dependence and program restructuring”, The Journal of Supercomputing 4, 1990, pp. 321–344.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Robert, Y., Song, S.W. (1992). New techniques for Cycle Shrinking. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_104
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_104
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive