Total Exchange Performance Modelling Under Network Contention

One of the most important collective communication patterns for scientific applications is the many to many, also called complete exchange. Although efficient All-to-All algorithms have been studied for specific networks, general solutions like those found in well known MPI distributions are strongly influenced by the congestion of network resources. In this paper we present our approach to model the performance of the All-to-All collective operation. Our approach consists in identifying a contention factor that characterises the network environment, and using it to augment a contention-free communication model. This approach allows an accurate prediction of the performance of the All-to-All operation over different network environments with a small cost. Indeed, we demonstrate the accuracy of our approach by presenting our experiments with three different network environments, Fast Ethernet, Giga Ethernet and Myrinet.

[1]  Ramesh Subramonian,et al.  LogP: a practical model of parallel computation , 1996, CACM.

[2]  Luiz Angelo Steffenel,et al.  Fast Tuning of Intra-cluster Collective Communications , 2004, PVM/MPI.

[3]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[4]  Csaba Andras Moritz,et al.  LoGPC: Modeling Network Contention in Message-Passing Programs , 2001, IEEE Trans. Parallel Distributed Syst..

[5]  David B. Skillicorn,et al.  Questions and Answers about BSP , 1997, Sci. Program..

[6]  Kenneth R. Jackson,et al.  An Efficient Transposition Algorithm for Distributed Memory Computers , 2002 .

[7]  Victor J. Rayward-Smith,et al.  UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[8]  Kees Verstoep,et al.  Network performance-aware collective communication for clustered wide-area systems , 2001, Parallel Comput..

[9]  Kees Verstoep,et al.  Fast Measurement of LogP Parameters for Message Passing Platforms , 2000, IPDPS Workshops.

[10]  Jesús Labarta,et al.  DiP: A Parallel Program Development Environment , 1996, Euro-Par, Vol. II.

[11]  Vikram S. Adve,et al.  Analyzing the behavior and performance of parallel programs , 1993 .

[12]  Csaba Andras Moritz,et al.  LoGPC: modeling network contention in message-passing programs , 1998, SIGMETRICS '98/PERFORMANCE '98.

[13]  Mark J. Clement,et al.  Network Performance Modeling for PVM Clusters , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[14]  Cho-Li Wang,et al.  Contention-Aware Communication Schedule for High-Speed Communication , 2003, Cluster Computing.