Abstract
Data and computation alignment is an important part of compiling sequential programs to architectures with non-uniform memory access times. In this paper, we show that elementary matrix methods can be used to determine communication-free alignment of code and data. We also solve the problem of replicating read-only data to eliminate communication. Our matrix-based approach leads to algorithms which are simpler and faster than existing algorithms for the alignment problem.
This research was supported by an NSF Presidential Young Investigator award CCR-8958543, NSF grant CCR-9008526, ONR grant N00014-93-1-0103, and a grant from Hewlett-Packard Corporation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Jennifer M. Anderson and Monica S. Lam. Global optimizations for parallelism and locality on scalable parallel machines. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 112–125, June 1993.
U. Banerjee. Loop transformations for restructuring compilers. Kluwer Publishing, 1993.
Siddartha Chatterjee, John Gilbert, and Robert Schreiber. The alignment-distribution graph. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing. Sixth International Workshop., number 768 in LNCS. Springer-Verlag, 1993.
Siddartha Chatterjee, John Gilbert, Robert Schreiber, and Shang-Hua Teng. Optimal evaluation of array expressions on massively parallel machines. Technical Report CSL-92-11, XEROX PARC, December 1992.
Jack Edmonds. Systems of distinct representatives and linear algebra. Journal of research of national bureau of standards (Sect. B), 71(4):241–245, 1967.
Paul Feautrier. Toward automatic distribution. Technical Report 92.95, IBP/MASI, December 1992.
Gene H. Golub and Charles F. Van Loan. Matrix Computations. The John Hopkins University Press, second edition, 1989.
C.-H. Huang and P. Sadayappan. Communication-free hyperplane partitioning of nested loops. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing. Fourth International Workshop. Santa Clara, CA., number 589 in LNCS, pages 186–200. Springer-Verlag, August 1991.
Kathleen Knobe, Joan D. Lucas, and William J. Dally. Dynamic alignment on distributed memory systems. In Proceedings of the Third Workshop on Compilers for Parallel Computers, July 1992.
Kathleen Knobe and Venkataraman Natarajan. Data optimization: minimizing residual interprocessor motion on SIMD machines. In Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation — Frontiers '90, pages 416–423, October 1990.
Jingke Li and Marina Chen. Index domain alignment: minimizing cost of cross-referencing between distributed arrays. Technical Report YALEU/DCS/TR-725, Department of Computer Science, Yale University, September 1989.
W. Li and K. Pingali. Access normalization: loop restructuring for NUMA compilers. In Proceedings of the 5th International Conference on Architectural Support for Programming Languages and Operating Systems, October 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bau, D., Kodukula, I., Kotlyar, V., Pingali, K., Stodghill, P. (1995). Solving alignment using elementary linear algebra. In: Pingali, K., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1994. Lecture Notes in Computer Science, vol 892. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025870
Download citation
DOI: https://doi.org/10.1007/BFb0025870
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58868-9
Online ISBN: 978-3-540-49134-7
eBook Packages: Springer Book Archive