Abstract
This paper addresses the problem of partitioning the iterations of nested loops, and data arrays accessed by the loops. Hyperplane partitions of disjoint subsets of data arrays and loop iterations that result in the elimination of communication are sought. A characterization of necessary and sufficient conditions for communicationfree hyperplane partitioning is provided.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Callahan and K. Kennedy. Compiling programs for distributed-memory multiprocessors. The Journal of Supercomputing, 2:151–169, Oct. 1988.
M. Chen, Y. Choo, and J. Li. Compiling parallel programs by optimizing performance. The Journal of Supercomputing, 2:171–207, Oct. 1988.
H. M. Gerndt. Array distribution in SUPERB. In Proceedings 1989 ACM International Conference on Supercomputing, pages 164–174, Athens, Greece, June 1989.
M. Gupta and P. Banerjee. Automatic data partitioning on distributed memory multiprocessors. Technical Report UILU-ENG-90-2248, Coordinated Science Laboratory, College of Engineering, University of Illinois at Urbana-Champaign, Oct. 1990.
C.-H. Huang and P. Sadayappan. Communication-free hyperplane partitioning of nested loops. Technical Report OSU-CISRC-7/91-TR18, Dept. of Comp/Info Sci., Ohio State Univ., July 1991.
K. Knobe, J. D. Lukas, and G. L. Steele Jr. Data optimization: Allocation of arrays to reduce communication on SIMD machines. J. Par. Dist. Comp., 8(2):102–118, Feb. 1990.
C. Koelbel, P. Mehrotra, and J. van Rosendale. Supporting shared data structures on distributed memory machines. In Proc. Principles and Practice of Parallel Programming, pages 177–186, 1990.
J. Li and M. Chen. Index domain alignment: Minimizing cost of cross-referencing between distributed arrays. Technical Report YALEU/DCS/TR-275, Dept. of Comp. Sc., Yale Univ, 1989.
J. Ramanujam. Compile-time Techniques for Parallel Execution of Loops on Distributed Memory Multiprocessors. PhD thesis, Dept. of Comp/Info. Sc., Ohio State Univ., 1990.
J. Ramanujam and P. Sadayappan. Compile-time techniques for data distribution for distributedmemory machines. IEEE Transactions on Parallel and Distributed Systems, 1991. To appear.
A. Rogers and K. Pingali. Process decomposition through locality of reference. In Proc. ACM SIGPLAN 89 Conf. Programming Language Design and Implementation, pages 69–80, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, C.H., Sadayappan, P. (1992). Communication-free hyperplane partitioning of nested loops. 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/BFb0038665
Download citation
DOI: https://doi.org/10.1007/BFb0038665
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