Abstract
Graph Traverse Scheduling is a loop partitioning method for shared memory multiprocessors that achieves minimum execution time of the parallel code generated assuming that a sufficient number of processors are available and synchronization cost is negligible. The method considers the set of statements in the loop body in the partitioning process.
In this paper we study how static schedules can be generated analyzing the compromise between number of processors, load balance and execution time. The method is presented in a descriptive way based on synthetic examples.
This work has been supported by the Ministry of Education of Spain (CICYT) in programs TIC 299/89 and 392/89.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ayguadé E., Labarta J., Torres J. and Borensztsjn P. (1989), 'GTS: Parallelization and Vectorization of Tight Recurrences”, Supercomputing'89, Reno-Nevada, pp.531–539.
Ayguadé E., Labarta J., Torres J., Llaberia J.M. and Valero M. (1990), “Nested-Loop Partitioning for Shared-Memory Multiprocessor Systems”, Workshop on Compilers for Parallel Computers, Paris-France, pp. 377–385.
Ayguadé E., Labarta J., Torres J., Llaberfa J.M. and Valero M. (1991), “Parallelism Evaluation and Partitioning of Nested Loops for Shared Memory Multiprocessors”, Advances in Languages and Compilers for Parallel Processing, Research Monographs in Parallel and Distributed Computing, Pitman/MIT, pp.220–242.
Cytron R.G. (1986), “Doacross: Beyond Vectorization for Multiprocessors”, 1986 Int'l Conf. on Parallel Processing, St. Charles IL, pp. 836–844.
Midkiff S. and Padua D. (1990), “Issues in the Compile-time Optimization of Parallel Programs”, 1990 Int'l. Conf. on Parallel Processing, St. Charles IL, vol. II, pp. 105–113.
Padua D.A. (1979), “Multiprocessors: Discussions of Some Theoretical and Practical Problems”, Ph.D. Thesis, Univ. of Illinois at Urbana-Champaign, DCS Report No. UIUCDCS-R-79-990.
Peir J. and Cytron R. (1989), “Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors”, IEEE Trans. on Computers, vol. 38, no. 8, pp. 1203–1211.
Shang W. and Fortes J.A.B. (1988), “Independent Partitioning of Algorithms with Uniform Dependencies”, Technical report School of Electrical Engineering, Purdue University.
Polychronopoulos C.D. (1988), “Parallel Programming and Compilers”, Kluwer Academic Pub., London.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Labarta, J., Ayguade, E., Torres, J., Valero, M., Llaberia, J.M. (1992). Balanced loop partitioning using GTS. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1991. Lecture Notes in Computer Science, vol 589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038672
Download citation
DOI: https://doi.org/10.1007/BFb0038672
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55422-6
Online ISBN: 978-3-540-47063-2
eBook Packages: Springer Book Archive