The scalable process topology interface of MPI 2.2

Concurrency and Computation: Practice and Experience

Volumn 23, Issue 4, 2011, Pages 293-310

  Hoefler, Torsten ^a   Rabenseifner, Rolf ^b   Ritzdorf, Hubert ^c   De Supinski, Bronis R ^d   Thakur, Rajeev ^e   Träff, Jesper Larsson ^f  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF STUTTGART   (Germany)

^c NEC LABORATORIES EUROPE   (Germany)

^d LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^e ARGONNE NATIONAL LABORATORY   (United States)

^f UNIVERSITY OF VIENNA   (Austria)

Author keywords

communication patterns; message passing interface; MPI; MPI 2.2; MPI forum; process mapping; process topologies; reordering

Indexed keywords

MAPPING; TOPOLOGY;

COMMUNICATION PATTERN; MESSAGE PASSING INTERFACE; MPI 2.2; MPI FORUM; PROCESS MAPPING; PROCESS TOPOLOGY; REORDERING;

MESSAGE PASSING;

EID: 79951761626     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1643     Document Type: Article

References (38)

1. MPI Forum. MPI: A Message-passing Interface Standard. Version 2.2, June 23rd, 2009. Available at: www.mpiforum.org [accessed July 2010].
2. Snir M, Otto SW, Huss-Lederman S, Walker DW, Dongarra J,. MPI: The Complete Reference. MIT Press: Cambridge, MA, 1996.
3. Calkin R, Hempel R, Hoppe HC, Wypior P,. Portable programming with the PARMACS message-passing library. Parallel Computing 1994; 20 (4): 615-632.
4. Balaji P, Buntinas D, Goodell D, Gropp W, Kumar S, Lusk E, Thakur R, Träff JL,. MPI on a million processors. Recent Advances in Parallel Virtual Machine and Message Passing Interface. The 16th European PVM/MPI Users' Group Meeting (Lecture Notes in Computer Science, vol. 5759), Espoo, Finland, Springer: Berlin, 2009; 20-30.
5. Träff JL,. SMP-aware message passing programming. The 8th International Workshop on High-level Parallel Programming Models and Supportive Environments (HIPS03), International Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France. IEEE Computer Society: Silver Spring, MD, 2003; 56-65.
6. Berti G, Träff JL,. What MPI could (and cannot) do for mesh-partitioning on non-homogeneous networks. Recent Advances in Parallel Virtual Machine and Message Passing Interface. The 13th European PVM/MPI Users' Gr (Pubitemid 44609357)
7. Bhatelée A, Kalé LV,. Benefits of topology aware mapping for mesh interconnects. Parallel Processing Letters 2008; 18 (4): 549-566.
8. Dally WJ,. Performance analysis of k-ary n-cube interconnection networks. IEEE Transactions on Computers 1990; 39 (6): 775-785.
9. Tvrdík P, Harbane R, Heydemann MC,. Uniform homomorphisms of de Bruijn and Kautz networks. Discrete Applied Mathematics 1998; 83 (1-3): 279-301. (Pubitemid 128390837)
10. Hoefler T, Schneider T, Lumsdaine A,. Multistage switches are not crossbars: Effects of static routing in high-performance networks. Proceedings of the 2008 IEEE International Conference on Cluster Computing, Tsukuba, Japan. IEEE Computer Society: Silver Spring, MD, 2008.
11. Mercier G, Clet-Ortega J,. Towards an efficient process placement policy for MPI applications in multicore environments. Recent Advances in Parallel Virtual Machine and Message Passing Interface, The 16th European PVM/MPI Users' Group Meeting (Lecture Notes in Computer Science, vol. 5759), Espoo, Finland. Springer: Berlin, 2009; 104-115.
12. Jeannot E, Mercier G,. Near-optimal placement of MPI processes on hierarchical NUMA architectures. Euro-Par 2010 Parallel Processing (Lecture Notes in Computer Science), Ischia, Italy. Springer: Berlin, 2010.
13. Hatazaki T,. Rank reordering strategy for MPI topology creation functions. The 5th European PVM/MPI User's Group Meeting (Lecture Notes in Computer Science, vol. 1497), Liverpool, U.K. Springer: Berlin, 1998; 188-195. (Pubitemid 128135109)
14. Yu H, Chung IH, Moreira JE,. Topology mapping for Blue Gene/L supercomputer. ACM/IEEE Supercomputing, 2006; 116.
15. Träff JL,. Implementing the MPI process topology mechanism. ACM/IEEE Supercomputing. ACM/IEEE Press, 2002. Available at: http://www.sc-2002.org/ paperpdfs/pap.pap122.pdf [accessed July 2010].
16. Castro A,. octopus: a tool for the application of time-dependent density functional theory. Physica Status Solidi (b) 2006; 243 (11): 2465-2488. (Pubitemid 44368981)
17. Karypis G, Kumar V,. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 1998; 20 (1): 359-392. (Pubitemid 128689516)
18. Hoefler T, Lorenzen F, Lumsdaine A,. Sparse non-blocking collectives in quantum mechanical calculations. Recent Advances in Parallel Virtual Machine and Message Passing Interface, The 15th European PVM/MPI Users' Group Meeting (Lecture Notes in Computer Science, vol. 5205), Dublin, Ireland. Springer: Berlin, 2008; 55-63.
19. Schüller A, (ed.). In Portable Parallelization of Indsutrial Aerodynamic Applications (POPINDA), Notes on Numerical Fluid Mechanics, vol. 71. Vieweg: Braunschweig, 1999.
20. Meakin RL,. Composite Overset Structured Grids, ch. 11. CRC Press: Boca Raton, FL, 1999.
21. Redler R, Valcke S, Ritzdorf H,. OASIS4 a coupling software for next generation earth system modelling. Geoscientific Model Development 2010; 3 (1): 87-104. Available at: http://www.geosci-model-dev.net/3/87/2010/ [accessed July 2010].
22. Valcke S, Guilyardi E, Larsson C,. PRISM and ENES: A European approach to earth system modelling. Concurrency and Computation: Practice and Experience 2006; 18 (2): 247-262. (Pubitemid 43132175)
23. Valcke S, Budich R, Carter M, Guilyardi E, Foujols MA, Lautenschlager M, Redler R, Steenman-Clark L, Wedi N,. A European network for earth system modelling. EOS, Transactions American Geophysical Union 2007; 88 (12): 143. DOI: 10.1029/2007EO120003.
24. Hill C, DeLuca C, Balaji, Suarez M, da Silva A,. The architecture of the earth system modeling framework. Computing in Science and Engineering 2004; 6 (1): 18-28.
25. Zhou S,. Coupling climate models with the earth system modeling framework and the common component architecture. Concurrency and Computation: Practice and Experience 2006; 18 (2): 203-213. (Pubitemid 43132172)
26. Walshaw C, Cross M,. Mesh partitioning: a multilevel balancing and refinement algorithm. SIAM Journal on Scientific Computing 2000; 22 (1): 63-80. (Pubitemid 32270871)
27. Walshaw C, Cross M,. Multilevel mesh partitioning for heterogeneous communication networks. Future Generation Computer Systems 2001; 17 (5): 601-623. (Pubitemid 32875232)
28. Pellegrini F, Roman J,. SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. High-performance Computing and Networking, International Conference and Exhibition, HPCN'96 (Lecture Notes in Computer Science, vol. 1067), Brussels, Belgium. Springer: Berlin, 1996; 493-498. (Pubitemid 126064089)
29. Chevalier C, Pellegrini F,. PT-Scotch: A tool for efficient parallel graph ordering. Parallel Computing 2008; 34 (6-8): 318-331.
30. Pellegrini F,. Graph partitioning based methods and tools for scientific computing. Parallel Computing 1997; 23 (1-2): 153-164. (Pubitemid 127367495)
31. Hoefler T, Siebert C, Lumsdaine A,. Scalable communication protocols for dynamic sparse data exchange. Proceedings of the 2010 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Bangalore, India. ACM: New York, 2010; 159-168.
32. Shipman GM, Woodall TS, Graham RL, Maccabe AB, Bridges PG,. InfiniBand scalability in Open MPI. Proceedings of IEEE Parallel and Distributed Processing Symposium, Rhodes, Greece. IEEE Computer Society: Silver Spring, MD, 2006.
33. Hong JW, Mehlhorn K, Rosenberg AL,. Cost trade-offs in graph embeddings, with applications. Journal of the ACM 1983; 30 (4): 709-728. (Pubitemid 14468695)
34. Monien B, Sudborough H,. Embedding one interconnection network into another. In Computational Graph Theory, Computing Supplement, Tinhofer G, Mayr E, Noltemeier H, Syslo MM, (eds). Springer: Berlin, 1990; 257-282.
35. Rosenberg AL,. Issues in the study of graph embeddings. Graphtheoretic Concepts in Computer Science. International Workshop (WG) (Lecture Notes in Computer Science, vol. 100), Bad Honnef, Germany. Springer: Berlin, 1980; 150-176.
36. Garey MR, Johnson DS,. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979. With an addendum, 1991.
37. Holtgrewe M, Sanders P, Schulz C,. Engineering a scalable high quality graph partitioner. International Parallel and Distributed Processing Symposium (IPDPS 2010), Atlanta, GA, U.S.A. IEEE Computer Society: Silver Spring, MD, 2010.
38. Hoefler T, Träff JL,. Sparse collective operations for MPI. Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium, HIPS'09 Workshop, Rome, Italy. IEEE Computer Society: Silver Spring, MD, 2009.