MPIPP: An automatic profile-guided parallel process placement toolset for SMP clusters and multiclusters

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2006, Pages 353-360

  Chen, Hu ^a   Chen, Wenguang ^b   Huang, Jian ^c   Robert, Bob ^c   Kuhn, H ^c  

^a INTEL CHINA RESEARCH CENTER   (China)

^b TSINGHUA UNIVERSITY   (China)

^c INTEL CORPORATION   (United States)

Author keywords

Cluster; Graph mapping; Graph partitioning; Parallel computing; Process placement

Indexed keywords

GRAPH MAPPING; GRAPH PARTITIONING; PROCESS PLACEMENT;

CLUSTERING ALGORITHMS; MESSAGE PASSING; NETWORK ARCHITECTURE; PROGRAM PROCESSORS; TOPOLOGY;

PARALLEL PROCESSING SYSTEMS;

EID: 34547472598     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183401.1183451     Document Type: Conference Paper

References (28)

1. D. Bailey, T. Harris, W. Saphir, R. van der Wijngaart, A. Woo, and M. Yarrow. The NAS parallel benchmarks 2.0. Technical Report NAS-95-020, NASA Ames Research Center, Dec. 1995.
2. ChARMM Team. CHARMM. http ://www.charmm.org
3. Culler, Karp, Patterson, Sahay, Schauser, Santos, Subramonian, and von Eicken. LogP: Towards a realistic model of parallel computation. In PPOPP: 4th ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming: PPOPP, 1993.
4. M. Deilmann, B. Roberg, M. Baum, and V. Scherer. Numerical simulation of evaporation and ignition of non-premixed n-heptane flames. In 5th International Conference on Parallel Processing and Applied Mathematics, Czestochowa, Poland, 2003.
5. J. Diaz, J. Petit, and M. Serna. A survey of graph layout problems. j-COMP-SURV, 34(3):313-356, Sept. 2003.
6. R,. A. Fiedler. Optimization and scaling of shared-memory and message-passing implementations of the zeus hydrodynamics algorithm. In Proceedings of Supercomputing'97 (CD-ROM), San Jose, CA, Nov. 1997. ACM SIGARCH and IEEE. Hewlett-Packard Company.
7. W. Gropp, E. Lusk, N. Doss, and A. Skjellum. A High-performance, portable implementation of the MPI Message Passing Interface Standard. Parallel Computing, 22(6):789-828, Sept. 1996.
8. B. Hendrickson and R. Leland. The Chaco User's Guide Version 2. Sandia, National Laboratories, Albuquerque NM, 1995.
9. Intel Ltd. Intel® Trace Analyzer & Collector, http ://www.intel.com/cd/software/products/ asmo-na/eng/cluster/tanalyzer/index.htm
10. Intel Ltd. Intel® MPI library. http ://www.intel.com/cd/software/ products/ asmo-na/eng/cluster/mpi/index.htm
11. G. Karypis and V. Kumar. METIS, Unstructured Graph Partitioning and Sparse Matrix Ordering System. Version 2.0. Technical report, University of Minnesota, Department of Computer Science, Minneapolis, MN 55455, Aug. 1995.
12. B. W. Kernighn and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291-307, Feb. 1970.
13. T. Kielmann, R. F. H. Hofman, H. E. Bal, A. Plaat, and R. Bhoedjang. MagPIe: MPPs collective communication operations for clustered wide area systems. In PPOPP, pages 131-140, 1999.
14. S. Kirkpatrick, C D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, Number 4598, 13 May 1983, 220, 4598:671-680, 1983.
15. G.-J. Lai and C Chen. A new scheduling strategy for numa multiprocessor systems. In ICPADS, pages 222-229. IEEE Computer Society, 1996.
16. C-H. Lee, M. Kim, and C-I. Park. An Efficient K-Way Graph Partioning Algorithm for Task Allocation in Parallel Computing Systems. In P. A. Ng, C. V. Ramamoorthy, L. C. Seifert, and R. T. Yeh, editors, Proceedings of the First International Conference on Systems Integration, Morristown, NJ, USA, April 1990, pages 748-751. IEEE Computer Society, 1990.
17. S.-Y. Lee and J. K. Aggarwal. A mapping strategy for parallel processing. IEEE Transaction on Computers, C-36(4):433-442, Apr. 1987.
18. V. M. Lo. Heuristic algorithms for task assignment in distributed systems. IEEE Trans. Computers, 37(11):1384-1397, 1988.
19. LS DYNA Team. LS DYNA. http ://www.dynalook.com/
20. R. Martin, A. Vahdat, D. Culler, and T. Anderson. Effect of communication latency, overhead, and bandwidth on a cluster architecture. Technical Report CSD-96-925, University of California, Berkeley, June 17, 1998.
21. B. Monien and S. Schamberger. Graph partitioning with the party library: Helpful-sets in practice. In SBAC-PAD, pages 198-205. IEEE Computer Society, 2004.
22. A. Pant and H. Jafri. Communicating efficiently on cluster based grids with mpich-vmi. In CLUSTER '04: Proceedings of the 2004 IEEE International Conference on Cluster Computing, pages 23-33, Washington, DC, USA, 2004. IEEE Computer Society.
23. S. Sanyal, A. Jain, S. K. Das, and R. Biswas. A hierarchical and distributed approach for mapping large applications to heterogeneous grids using genetic algorithms. In CLUSTER, pages 496-499. IEEE Computer Society, 2003.
24. ScaliMPI Team. ScaliMPI. http ://www.scali.no/download/doc/Scali_MPI_ Connect_FF_4_3_6_121104_EXT.pdf
25. J. L. Traff. Implementing the MPI process topology mechanism. In IEEE, editor, SC2002: From Terabytes to Insight. Proceedings of the IEEE ACM SC 2002 Conference, November 16-22. 2002, Baltimore, MD, USA, pages 1-14, pub-IEEE:adr, 2002. pub-IEEE.
26. Walshaw and Cross. Mesh partitioning: A multilevel balancing and refinement algorithm. SIJSSC: SIAM Journal on Scientific and Statistical Computing, apparently renamed SIAM Journal on Scientific Computing, 22, 2000.
27. L. Weijian, C Wenguang, L. Zhiguang, and Z. Weimin. Communication optimization for smp clusters. Tsinghua Science and Technology, 6(l):18-23, 2001.
28. WRF Team. WRF. http://www.wrf-model.org/