Abstract
Data-parallel languages, in particular HPF, provide a high-level view of operators overs parallel data structures and hide the details of data partitioning and communication. One of the most difficult issues in compiling such languages is managing irregular data-dependent parallelism. This paper presents the study of a realistic, but non adaptive irregular application. We show that HPF can easily express the natural parallelism of the application. Experimental results and a detailed examination of the compiler process are presented.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
High performance Fortran language specification. Technical report, Rice University Houston Texas, January 93. V1.0 Draft.
High Performance Fortran Forum. High Performance FOrtran Language Specification, V2.0 σ, Rice University Houston Texas, October 96
P.E. Bjorstad and O.B. Widlund. Iterative methods for the solution of elliptic problems on region partitioned into substructures. SIAM J. Numerical Analysis, 23:1097–1120,1986
F. Coelho, C. Germain and J-L Pazat. Compiling HPF. In A. Darte G.-R. Perrin, editors, The Data Parallel Programming Model, pages 104–130. Springer Verlag, 1996. LNCS 1132.
E. Cuthill and J. Mackee. Reducing the band width of sparse symmetric matrices. In ACM Nat. Conference, pages 157–172, 1969
R. Das et al. Communication optimization for irregular scientific computations on distributed memory architectures. Jal of Parallel and Distributed Computing, 22:462–478, 94.
C. Germain and D. Gautier de Lahaut. Improving Irregular Parallel Communication through Sorting. High Performance Computing and networking Conf, HPCN'97. To appear in LNCS
M. Gupta, E. Schonberg and H. Srinivasan. A unified data-flow framework for optimizing communication in data-parallel programs. IEEE Trans. on Parallel and Distributed Systems, 7(7):689–704, 96.
R. Ponnusamy, J. Saltz and A. Choudhary. Runtime compilation techniques for data partitioning and communication schedule reuse. In Supercomputing 93, pages 361–370. ACM, 93.
R. Ponnusamy et al. Supporting irregular distributions in Fortran 90D/HPF compilers. Technical report CS-TR-3268 and UMIACS-TR-94-57, 94
M. Ranganathan et al. Runtime coupling of data-parallel programs. In Supercomputing'96. IEEE, May 96.
S. D. Sharma and al. Run-time and Compile-time Support for Adaptive Irregular Problems. In Supercomputing'94, pages 99–106. IEEE Press, 94.
H.D. Simon. Partitioning of unstructured problems for parallel processing. Computing Systems in Eng. 2(2/3):135–148, 91
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Germain, C., Laminie, J., Pallud, M., Etiemble, D. (1997). An HPF case study of a domain-decomposition based irregular application. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1997. Lecture Notes in Computer Science, vol 1277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63371-5_21
Download citation
DOI: https://doi.org/10.1007/3-540-63371-5_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63371-6
Online ISBN: 978-3-540-69525-7
eBook Packages: Springer Book Archive