What MPI could (and Cannot) do for mesh-partitioning on non-homogeneous networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4192 LNCS, Issue , 2006, Pages 293-302

  Berti, Guntram ^a   Träff, Jesper Larsson ^a  

^a NEC LABORATORIES EUROPE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL CONTROL SYSTEMS; PERSONAL COMMUNICATION SYSTEMS; PROBLEM SOLVING; SCHEDULING; TOPOLOGY;

CERTAIN SYSTEM CONFIGURATIONS; LOAD BALANCING PROBLEM; MESH PARTITIONING; SUB OPTIMAL PARTITIONING;

TELECOMMUNICATION NETWORKS;

EID: 33750230734     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11846802_42     Document Type: Conference Paper

References (17)

1. K. D. Devine, E. G. Boman, R. T. Heaphy, B. A. Hendrickson, J. D. Teresco, J. Faik, J. E. Flaherty, and L. G. Gervasio. New challenges in dynamic load balancing. Appl. Numer. Math., 52(2-3):133-152, 2005.
2. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In 19th ACM/IEEE Design Automation Conference (DAC), pages 175-181, 1982.
3. M. R. Garey, D. S. Johnson, and L. J. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1(3):237-267, 1976.
4. B. Hendrickson and T. G. Kolda. Graph partitioning models for parallel computing. Parallel Computing, 26:1519-1534, 2000.
5. B. Hendrickson and R. Leland. A multi-level algorithm for partitioning graphs. In Proceedings of the 1995 ACM/IEEE Supercomputing Conference, 1995.
6. B. Hendrickson, R. Leland, and R. V. Driessche. Skewed graph partitioning. In Proc. 8th SIAM Conference on Parallel Processing for Scientific Computing, 1997.
7. G. Karypis. METIS. http://www-users.cs.umn.edu/~karypis/metis/.
8. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49:291-307, 1970.
9. I. Moulitsas and G. Karypis. Architecture aware partitioning algorithms. Technical Report DCT Research Report 2006/02, Digital Technology Center, University of Minnesota, Jan. 2006.
10. F. Pellegrini and J. Roman. SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In High-Performance Computing and Networking (HPCN), Europe, volume 1067 of Lecture Notes in Computer Science, pages 493-498. Springer-Verlag, 1996.
11. J. E. Savage and M. G. Wloka. Parallelism in graph-partitioning. Journal of Parallel and Distributed Computing, 13:257-272, 1991.
12. M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra. MPI - The Complete Reference, volume 1, The MPI Core. MIT Press, second edition, 1998.
13. J. L. Träff. Implementing the MPI process topology mechanism. In Supercomputing, 2002. http://www.sc-2002.org/paperpdfs/pap.pap122.pdf.
14. J. L. Träff. SMP-aware message passing programming. In Eigth International Workshop on High-level Parallel Programming Models and Supportive Environments (HIPS03), pages 56-65, 2003.
15. S. Valcke, D. Declat, R. Redler, H. Ritzdorf, R. Vogelsang, and P. Bourcier. The PRISM coupling and I/O system. In Proceedings of VECPAR 2004, 2004.
16. C. Walshaw and M. Cross. Multilevel mesh partitioning for heterogeneous communication networks. Future Generation Comput. Syst., 17(5):601-623, 2001.
17. Zoltan: Data-management services for parallel applications, http://www.cs.sandia.gov/Zoltan/.