Copyright © 2008 The Institute of Electronics, Information and Communication Engineers
Regular Section -- Papers -- Network |
Performance Models for MPI Collective Communications with Network Contention
1 The authors are with the Department of Informatics, Kyushu University, Fukuoka-shi, 814-0001 Japan. E-mail: hnzigoum{at}c.csce.kyushu-u.ac.jp, 2 The authors are with Institute of Systems & Information Technologies/KYUSHU, Fukuoka-shi, 814-0043 Japan., 3 The author is with Computing and Communications Center, Kyushu University, Fukuoka-shi, 814-0001 Japan.
 |
Abstract |
|---|
The paper presents a novel approach to estimate the performance of MPI collective communications. Our objective is to help researchers to make appropriate decisions on their message-passing applications. For each collective communication, we attempt to apply LogGP and P-LogP standard point-to-point models. The resulted models are compared with the empirical data in order to identify the most suitable for performance characterization of collective operations. For the communications on large clusters with large size messages, the network contention problem can significantly affect the performance. Hence, to reduce the relative gap between the prediction and the measured runtime, the contention issue is also modeled, by a queuing theory analysis method, and taken in account with the total performance estimation. The experiments performed on a cluster which consists of 64 processors interconnected by Gigabit Ethernet network show encouraging results. For any collective operation, given a number of processors and a range of message sizes, there is at least one model that predicts the performance precisely. We could achieve a gap between the predicted and the measured run-time around 15%. Thus, by handling the contention problem, we could reduce around 80% of the relative gap.
Key Words: MPI, collective communications, performance prediction, queuing theory, contention issue
Manuscript received April 27, 2007. Manuscript revised August 8, 2007.