Protocol-Aware Process Placement for MPI Programs

XU Xinhai; LIN Yufei; YANG Xuejun

Article Contents

Article Navigation > Chinese Journal of Electronics > 2014 > 23(4): 701-705

XU Xinhai, LIN Yufei, YANG Xuejun, “Protocol-Aware Process Placement for MPI Programs,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 701-705, 2014,

Citation:

XU Xinhai, LIN Yufei, YANG Xuejun, “Protocol-Aware Process Placement for MPI Programs,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 701-705, 2014,

XU Xinhai, LIN Yufei, YANG Xuejun, “Protocol-Aware Process Placement for MPI Programs,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 701-705, 2014,

Citation:

XU Xinhai, LIN Yufei, YANG Xuejun, “Protocol-Aware Process Placement for MPI Programs,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 701-705, 2014,

PDF( 314 KB)

Protocol-Aware Process Placement for MPI Programs

State Key Laboratory of High Performance Computing, National University of Defense Technology, Changsha 410073, China

Funds: This work is supported by the National Natural Science Foundation of China (No.61303071, No.61120106005, No.60921062).

Received Date: 2013-09-01
Rev Recd Date: 2013-11-01
Publish Date: 2014-10-05

Abstract

Abstract

Current parallel programs are often composed of lots of processes that communicate through message passing. The mapping of the program processes onto the underlying processor. By analyzing the MPI library, we find that the communication protocols have great influence upon the communication characteristics. The profiling information used by the existing process placement methods does not include the communication protocols. We propose and implement a method called Protocol-aware process placement (PaPP) to incorporate the influences of communication protocols into the mapping problem. We demonstrate the validations of PaPP by the experiments using NPB3.3-MPI benchmarks. The experimental results show that compared to basic process placement, the average execution time when using PaPP scheme is reduced by 9.5%.
- Process placement,
- Communication protocol,
- Graph mapping,
- MPI

FullText(HTML)

References(14)

References

H. El-Rewini and M. Abd-El-Barr, Message passing interface (mpi), Advanced Computer Architecture and Parallel Processing, pp.205-233, 2005.

A. Pant and H. Jafri, Communicating efficiently on cluster based grids with mpich-vmi, IEEE International Conference on Cluster Computing, San Diego, California, USA, pp.23-33, 2004.

H. Chen, W. Chen, J. Huang, B. Robert and H. Kuhn, Mpipp: An automatic profile-guided parallel process placement toolset for smp clusters and multiclusters, Proceedings of the 20th Annual International Conference on Supercomputing, Cairns, Australia, pp.353-360, 2006.

J. Zhang, J. Zhai, W. Chen and W. Zheng, Process mapping for mpi collective communications, Proceedings of the 15th International Euro-Par Conference on Parallel Processing, Delft, The Netherlands, pp.81-92, 2009.

J.L. Träff, Implementing the mpi process topology mechanism, Proceedings of the 2002 ACM/IEEE Conference on Supercomputing, Baltimore, Maryland, pp.1-14, 2002.

R. Asbury and M. Wrinn, Mpi tuning with intel trace analyzer and intel trace collector, 2004 IEEE International Conference on Cluster Computing, pp.4, 2004.

W.E. Nagel, A. Arnold, M. Weber, H.-C. Hoppe and K. Solchenbach, Vampir: Visualization and analysis of mpi resources, Supercomputer, Vol.12, pp.69-80, 1996.

D.A. Grove, Performance modelling of message-passing parallel programs, Ph.D. dissertation, University of Adelaide, Australia, 2003.

H. Lu, X. Chen and L. Jing, Parallel test task scheduling with constraints based on hybrid particle swarm optimization and taboo search, Chinese Journal of Electronics, Vol.21, No.4, pp.615-617, 2012.

B. Ucar, C. Aykanat, K. Kaya and M. Ikinci, Task assignment in heterogeneous computing systems, J. Parallel Distrib. Comput., Vol.66, No.1, pp.32-46, 2006.

B. Kernighan and S. Lin, An effective heuristic procedure for partitioning graphs, The Bell System Technial Journal, Vol.49, No.2, pp.291-308, 1970.

F. Pellegrini, Static mapping by dual recursive bipartitioning of process architecture graphs, Proceedings of the Scalable High-Performance Computing Conference, Knoxville, Tennessee, USA, pp.486-493, 1994.

C.H. Lee, M. Kim and C.I. Park, An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems, Proceedings of the First International Conference on Systems Integration on Systems Integration, Morristown, New Jersey, United States, pp.748-751, 1990.

M. Xie, Y. Lu, L. Liu, H. Cao and X. Yang, Implementation and evaluation of network interface and message passing services for tianhe1a supercomputer, Proceedings of the 19th Annual Symposium on High Performance Interconnects, Santa Clara, California, USA, pp.78-86, 2011.

Relative Articles

Supplements(0)

Cited By

Proportional views