Abstract
Irregular problems are widely regarded as especially difficult for data-parallel compilers targeting the message-passing communication model. The inspector/executor code generation scheme successfully tackles irregular problems exhibiting a high level of data sharing, but little has been done for irregular problems without spatial or temporal locality. This paper proposes a technique based on sorting. The complexity of the method is shown to be better than that of the naive method. Experimental results compare the sorting method with a commercial implementation of the naive method, and shows the efficiency of the sorting method in practice.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E.A. Brewer. High-Level Optimization via Automated Statistical Modeling. In PoPPL, pages 80–91. ACM Press, 95.
S. Chatterjee, J.R. Gilbert, F. Long, R. Shreiber, and S-H. Teng. Generating local addresses and communication sets for data-parallel programs. In Symp on Principles and Practice of Programming Languages 93. ACM, 93.
A.C. Dusseau et al. Fast Parallel Sorting under LogP: Experience with the CM-5. IEEE Trans. on Parallel and Distributed Sytems, 7(8):791–805, 96.
Chi-Chao Chang et al. Low-latency communication on the IBM RISC System/6000 SP. In Supercomputing '96. IEEE, 96.
M. Ranganathan et al. Runtime coupling of data-parallel programs. In Supercomputing'96. IEEE, May 96.
F.Irigoin, C. Ancourt, F. Coelho, and R. Keryell. A linear algebra framework for static HPF code distribution. In 4th Int. Workshop on Compilers for Parallel Computers, pages 117–132, 93.
C. Germain and F. Delaplace. Automatic vectorization of communications for data-parallel programs. In Europar95, LNCS966, pages 429–440. Springer Verlag, 1995.
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.
S.K.S. Gupta and al. On compiling array expressions for efficient execution on distributed-memory machines. In 1993 Int. Conf. on Parallel Processing, pages II-301–II-305, 93.
K. Kennedy, N. Nedeljkovic, and A. Sethi. Communication generation for cyclic(k) distributions. In 3rd Work. on Languages compilers and run-time systems for parallel processing, pages 185–196. Kluwer, 95.
F.T. Leighton. Parallel Algorithms and Architectures. Morgan Kaufmann, 92.
High Performance Fortran Forum. High Performance Fortran Language Specification v2.0 δ. Technical report, Rice University Houston Texas, October 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.
S. D. Sharma and al. Run-time and Compile-time Support for Adaptive Irregular Problems. In Supercomputing '94, pages 99–106. IEEE Press, 94.
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., Gautier de Lahaut, D. (1997). Improving irregular parallel communication through sorting. In: Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1997. Lecture Notes in Computer Science, vol 1225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031653
Download citation
DOI: https://doi.org/10.1007/BFb0031653
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62898-9
Online ISBN: 978-3-540-69041-2
eBook Packages: Springer Book Archive