Abstract
A large fraction of all parallel applications use process topologies. Mapping of those topologies onto hardware architecture has been studied for long time. Meanwhile, many current multiprocessor systems are implemented in modular architecture. This paper presents a new mapping strategy that takes advantage of this modularity. The idea was implemented in MPI's topology creation functions and found to be very effective.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was done as part of MPI development project at Hewlett-Packard Company
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
V. David, Ch. Fraboul, JY. Rousselot, and P. Siron: Partitioning and mapping communication graphs on a modular reconfigurable parallel architecture. Parallel Processing: CONPAR92-VAPPV, 2nd Joint International Conference on Vector and Parallel Processing. Lyon, France Sep. 1992
F. Ercal, J. Ramanujam, and P. Sadayappan: Task Allocation onto a Hypercube by Recursive Mincut Bipartitioning. Journal of Parallel and Distributed Computing 10 (1990) 35–44
C. M. Fiduccia and R. M. Mattheyses: A linear-time heuristic for improving network partitions. Proceedings of the 19th Design Automation Conference, pp. 175–181 (1982)
Hewlett-Packard Company: HP MPI User's Guide. HP Press (1997)
B. W. Kernighan and S. Lin: An Efficient Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal vol. 49, pp. 291–307 (1970)
Steven S. Lumetta, Alan M. Mainwaring, and David E. Culler: Multi-Protocol Active Messages on a Cluster of SMP's. Proceedings of Super Computing Conference '97 (1997)
O. Kramer and H. Muhlenbein: Mapping strategies in message-based multiprocessor systems. Parallel Computing 9 (1989) 213–225
Message-Passing Forum: MPI: Message-Passing Interface Standard. June 1995
Alex Pothen: Graph Partitioning Algorithms with Applications to Scientific Computing. Old Dominion Univ. Technical Report (1997)
W. Gropp, E. Lusk, and A. Skjellum: USING MPI: Portable Parallel Programming with the Message-Passing Interface. The MIT Press (1994)
John E. Savege and Markus G. Wloka: Parallel Graph-Embedding and the Mob Heuristic. Brown University Department of Computer Science, Technical Report No. CS-91-07 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hatazaki, T. (1998). Rank reordering strategy for MPI topology creation functions. In: Alexandrov, V., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1998. Lecture Notes in Computer Science, vol 1497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056575
Download citation
DOI: https://doi.org/10.1007/BFb0056575
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65041-6
Online ISBN: 978-3-540-49705-9
eBook Packages: Springer Book Archive