ACM Home Page
Please provide us with feedback. Feedback
An efficient MPI_allgather for grids
Full text PdfPdf (238 KB)
Source
High Performance Distributed Computing archive
Proceedings of the 16th international symposium on High performance distributed computing table of contents
Monterey, California, USA
SESSION: Communication table of contents
Pages: 169 - 178  
Year of Publication: 2007
ISBN:978-1-59593-673-8
Authors
Rakhi Gupta  Jaypee Institute of Information Technology University
Sathish S. Vadhiyar  Indian Institute of Science
Sponsors
ACM: Association for Computing Machinery
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 55,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1272366.1272388
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. B.-Estefanel and G. Mounie. Identifying Logical Homogeneous Clusters for Efficient Wide-Area Communication. In In Proceedings of the Euro PVM/MPI 2004, volume LNCS Vol. 3241, pages 319--326, 2004.
 
2
O. Beaumont, V. Boudet, and Y. Robert. A Realistic Model and an Efficient Heuristic for Scheduling with Heterogenous Processors. In Proceedings of 11th Heterogeneous Computing Workshop, 2002.
 
3
G. Benson, C.-W. Chu, Q. Huang, and S. Caglar. A Comparison of MPICH Allgather Algorithms on Switched Networks, volume 2840/2003 of Lecture Notes in Computer Science, pages 335--343. Springer Berlin / Heidelberg, September 2003. Recent Advances in Parallel Virtual Machine and Message Passing Interface, 10th European PVM/MPI Users' Group Meeting.
 
4
 
5
H. Casanova. Network Modeling Issues for Grid Application Scheduling. International Journal of Foundations of Computer Science (IJFCS), 16(2):145--162, 2005.
6
7
8
 
9
R. Gupta and S. Vadhiyar. Application-Oriented Adaptive MPI_Bcast for Grids. In Proceedings of International Parallel and Distributed Processing Symposium (IPDPS'06), Rhodes Island, Greece, 2006.
 
10
L. Hollermann, T.-S. Hsu, D. Lopez, and K. Vertanen.Scheduling Problems in a Practial Allocation Model. Journal of Combinatorial Optimization, 1(2):129--149, 1997.
 
11
 
12
 
13
14
 
15
 
16
 
17
Mpich2 home page. http://www-unix.mcs.anl.gov/mpi/mpich2.
 
18
MPICH-G2. http://www3.niu.edu/mpi.
 
19
K. Park, H. Lee, Y. Lee, O. Kwon, S. Park, and S. K. H. W. Park. An Efficient Collective Communication Method for Grid Scale Networks. In Proceedings of the International Conference on Computational Science, pages 819--828, Melbourne, Australia and St. Petersburg, Russia, June 2003.
 
20
 
21
 
22
R. Thakur, R. Rabenseifner, and W. Gropp. Optimization of Collective Communication Operations in MPICH. International Journal of High Performance Computing Applications, 19(1):49--66, Spring 2005.

Collaborative Colleagues:
Rakhi Gupta: colleagues
Sathish S. Vadhiyar: colleagues