Abstract
This article deals with the run-time comparison between several algorithms (including the MPI_Alltoallv() function call) to perform the redistribution of arrays that are distributed in a block-cyclic fashion over a multidimensional processor grid. The generation of the communication messages to be exchanged by the processors involved in the redistribution is not taken into account. Rather we focus on the scheduling of those messages: how to organize the message exchanges into “structured” communication steps that will minimize communication overhead.
This work was supported in part by the National Science Foundation Grant No. ASC-9005933; by the Defense Advanced Research Projects Agency under contract DAAH04-95-1-0077, administered by the Army Research Office; by the Department of Energy Office of Computational and Technology Research, Mathematical, Information, and Computational Sciences Division under Contract DE-AC05-84OR21400; by the National Science Foundation Science and Technology Center Cooperative Agreement No. CCR-8809615; by the CNRS-ENS Lyon-INRIA project ReMaP; and by the Eureka Project EuroTOPS. Yves Robert is on leave from Ecole Normale Supérieure de Lyon and is partly supported by DRET/DGA under contract ERE 96-1104/A000/DRET/DS/SR.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Frédéric Desprez, Jack Dongarra, Antoine Petitet, Cyril Randriamaro, and Yves Robert. Scheduling block-cyclic array redistribution. Research Report 97-349, Computer Science Department, University of Tennessee at Knoxville, February 1997. Also available as LAPALK Working Note 120, http://www.netlib.org/lapack/lawns.
J. J. Dongarra and D. W. Walker. Software libraries for linear algebra computations on high performance computers. SIAM Review, 37(2):151–180, 1995.
E. T. Kalns and L. M. Ni. Processor mapping techniques towards efficient data redistribution. IEEE Trans. Parallel Distributed Systems, 6(12):1234–1247, 1995.
L. Prylli and B. Tourancheau. Efficient block-cyclic data redistribution. In EuroPar'96, volume 1123 of Lectures Notes in Computer Science, pages 155–164. Springer Verlag, 1996.
M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. Dongarra. MPI the complete reference. The MIT Press, 1996.
David W. Walker and Steve W.Otto. Redistribution of block-cyclic data distributions using MPI. Concurrency: Practice and Experience, 8(9):707–728, 1996.
Lei Wang, James M. Stichnoth, and Siddhartha Chatterjee. Runtime performance of parallel array assignment: an empirical study. In 1996 ACM/IEEE Supercomputing Conference. http://www.supercomp.org/sc96/proceedings, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dongarra, J., Desprez, F., Petitet, A., Randriamaro, C., Robert, Y. (1997). Block-cyclic array redistribution on networks of workstations. In: Bubak, M., Dongarra, J., Waśniewski, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1997. Lecture Notes in Computer Science, vol 1332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63697-8_103
Download citation
DOI: https://doi.org/10.1007/3-540-63697-8_103
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63697-7
Online ISBN: 978-3-540-69629-2
eBook Packages: Springer Book Archive