An efficient collective communication method using a shortest path algorithm in a computational grid

Abstract

In a computational grid, collective communication methods are inefficient because of heterogeneous network's features on wide area network. In this paper, we propose the efficient MPI(Message Passing Interface)'s collective communication method in a computational grid on wide area network. The SPPT(Shortest-Path-based Process Tree) algorithm is our proposed algorithm that creates the dynamic-process-tree based on latency information to communicate with each process for efficient collective communication. The experiment shows that the performance of MPI broadcast operation implemented by the SPPT algorithm is higher about 50% and 15% than the Flat-Tree and the HLOT algorithms, respectively, in a grid network which has relatively high latency links. © Springer-Verlag Berlin Heidelberg 2005.