19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers Message Scheduling for All-to-All Personalized Communication on Ethernet Switched Clusters Denver, Colorado April 04-April 08 ISBN: 0-7695-2312-9
We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all-to-all personalized communication (AAPC) on any given Ethernet switched cluster. Based on the scheduling scheme, we implement an automatic routine generator that takes the topology information as input and produces a customized MPI Alltoall routine, a routine in the Message Passing Interface (MPI) standard that realizes AAPC. Experimental results show that the automatically generated routine consistently out-performs other MPI Alltoall algorithms, including those in LAM/MPI and MPICH, on Ethernet switched clusters with different network topologies when the message size is sufficiently large. This demonstrates the superiority of the proposed AAPC algorithm in exploiting network bandwidths.
Citation:
Ahmad Faraj, Xin Yuan, "Message Scheduling for All-to-All Personalized Communication on Ethernet Switched Clusters," ipdps, vol. 1, pp.85a, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers, 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||