Abstract
This paper proposes a compiler strategy for mapping FORTRAN programs onto distributed memory computers. Once the available parallelism has been identified, the minimisation of different costs will suggest different data and computation partitions. This is further complicated, as the effectiveness of the partition will depend on later compiler optimisations. For this reason, partitioning is at the crux point of compilation and this paper describes an automatic data partition algorithm which is based on the analysis of four distinct factors. By determining the relative merit of each form of analysis, a data partitioning decision is made which is part of an overall compilation strategy. The strategy is applied to a real non-trivial program on a 32 cell KSR-1 where the performance is comparable to that of hand-coded techniques.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Gupta M., “Automatic Data Partitioning on Distributed Memory Multicomputers”, University of Illinois at Urbana-Champaign, Centre for Reliable and High Performance Computing, UILU-ENG-92-2237,CRHC-92-19, September 1992.
Li J. and Chen M., “Index Domain Alignment: Minimising Cost of Cross-Referencing between Distributed Arrays”, IEEE Proceedings of the Third Symposium on the Frontiers of Massively Parallel Computation, October 1990.
O'Boyle M.F.P. and Hedayat G.A., “Data Alignment: Transformations to Reduce Communication on Distributed Memory Architectures”, Scalable High Performance Computing Conference, Williamsburg, April 1992.
O'Boyle M.F.P., “A Data Partitioning Algorithm for Distributed Memory Compilation”, University of Manchester,T.R. UMCS-93-7-1, 1993
Wholey S., “Automatic Data Mapping for Distributed-Memory Parallel Computers”, International Conference on Supercomputing, ACM Press, July 1992.
Watts T.M., Soffa M.L. and Gupta R., “Techniques for Integrating Parallelizing Transformations and Compiler-Based Scheduling Methods”, Supercomputing '92, November 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O'Boyle, M. (1994). A data partitioning algorithm for distributed memory compilation. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_90
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_90
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive