Skip to main content
SpringerLink
Log in

Rank reordering strategy for MPI topology creation functions

  • Conference paper
  • First Online:
Recent Advances in Parallel Virtual Machine and Message Passing Interface (EuroPVM/MPI 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1497))

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.

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 to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Google Scholar 

  2. 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

    Article  Google Scholar 

  3. 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)

    Google Scholar 

  4. Hewlett-Packard Company: HP MPI User's Guide. HP Press (1997)

    Google Scholar 

  5. B. W. Kernighan and S. Lin: An Efficient Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal vol. 49, pp. 291–307 (1970)

    MATH  Google Scholar 

  6. 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)

    Google Scholar 

  7. O. Kramer and H. Muhlenbein: Mapping strategies in message-based multiprocessor systems. Parallel Computing 9 (1989) 213–225

    Article  MathSciNet  Google Scholar 

  8. Message-Passing Forum: MPI: Message-Passing Interface Standard. June 1995

    Google Scholar 

  9. Alex Pothen: Graph Partitioning Algorithms with Applications to Scientific Computing. Old Dominion Univ. Technical Report (1997)

    Google Scholar 

  10. W. Gropp, E. Lusk, and A. Skjellum: USING MPI: Portable Parallel Programming with the Message-Passing Interface. The MIT Press (1994)

    Google Scholar 

  11. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NKK Corporation, 1-1-2 Marunouchi, Chiyoda-ku, 100-8202, Tokyo, Japan

    Takao Hatazaki

Authors
  1. Takao Hatazaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Vassil Alexandrov Jack Dongarra

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation