|
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
|
Ernie Chan , Robert van de Geijn , William Gropp , Rajeev Thakur, Collective communication on architectures that support simultaneous communication over multiple links, Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming, March 29-31, 2006, New York, New York, USA
[doi> 10.1145/1122971.1122975]
|
 |
7
|
David Culler , Richard Karp , David Patterson , Abhijit Sahay , Klaus Erik Schauser , Eunice Santos , Ramesh Subramonian , Thorsten von Eicken, LogP: towards a realistic model of parallel computation, Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.1-12, May 19-22, 1993, San Diego, California, United States
|
 |
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
|
Thilo Kielmann , Rutger F. H. Hofman , Henri E. Bal , Aske Plaat , Raoul A. F. Bhoedjang, MagPIe: MPI's collective communication operations for clustered wide area systems, Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming, p.131-140, May 04-06, 1999, Atlanta, Georgia, United States
|
| |
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.
|
|