Strategies to Map Parallel Applications onto Meshes

The optimal mapping of tasks of a parallel program onto nodes of a parallel computing system has a remarkable impact on application performance. We propose a new criterion to solve the mapping problem in 2D and 3D meshes that uses the communication matrix of the application and a cost matrix that depends on the system topology.We test via simulation the performance of optimization-based mappings, and compare it with consecutive and random trivial mappings using the NAS Parallel Benchmarks. We also compare application runtimes on both topologies. The final objective is to determine the best partitioning schema for large-scale systems, assigning to each application a partition with the best possible shape.

[1]  Bill Nitzberg,et al.  Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers , 1997, IEEE Trans. Parallel Distributed Syst..

[2]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[3]  Javier Navaridas,et al.  Effects of Job and Task Placement on Parallel Scientific Applications Performance , 2009, 2009 17th Euromicro International Conference on Parallel, Distributed and Network-based Processing.

[4]  Hans Werner Meuer,et al.  Top500 Supercomputer Sites , 1997 .

[5]  Laxmikant V. Kalé,et al.  Topology-aware task mapping for reducing communication contention on large parallel machines , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[6]  Javier Navaridas,et al.  Interconnection Network Simulation Using Traces of MPI Applications , 2009, International Journal of Parallel Programming.

[7]  Hee Yong Youn,et al.  Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems , 2003, IEEE Trans. Computers.

[8]  José Miguel-Alonso,et al.  INSEE: An Interconnection Network Simulation and Evaluation Environment , 2005, Euro-Par.

[9]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[10]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[11]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

[12]  Laxmikant V. Kalé,et al.  An evaluative study on the effect of contention on message latencies in large supercomputers , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.