ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

An Efficient MPI_Allgather for Grids

Gupta, Rakhi and Vadhiyar, Sathish S (2007) An Efficient MPI_Allgather for Grids. In: HPDC '07 Proceedings of the 16th international symposium on High performance distributed computing , New York, NY.

[img] PDF
An_Efficient.pdf - Published Version
Restricted to Registered users only

Download (232Kb) | Request a copy
Official URL: http://dl.acm.org/citation.cfm?id=1272388

Abstract

Allgather is an important MPI collective communication. Most of the algorithms for allgather have been designed for homogeneous and tightly coupled systems. The existing algorithms for allgather on Gridsystems do not efficiently utilize the bandwidths available on slow wide-area links of the grid. In this paper, we present an algorithm for allgather on grids that efficiently utilizes wide-area bandwidths and is also wide-area optimal. Our algorithm is also adaptive to gridload dynamics since it considers transient network characteristics for dividing the nodes into clusters. Our experiments on a real-grid setup consisting of 3 sites show that our algorithm gives an average performance improvement of 52% over existing strategies.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to ACM Press.
Keywords: MPI Allgather;Grids
Department/Centre: Division of Information Sciences > Supercomputer Education & Research Centre
Date Deposited: 19 Oct 2011 06:52
Last Modified: 19 Oct 2011 06:52
URI: http://eprints.iisc.ernet.in/id/eprint/41526

Actions (login required)

View Item View Item