Total Exchange Performance Modelling Under Network Contention

Proceedings of the 6th International Conference on Parallel Processing and AppliedMathematics, Poznan, Poland. September 2005. 8 pagesInternational audienceOne 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