A comparison of MPICH allgather algorithms on switched networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2840, Issue , 2003, Pages 335-343

  Benson, Gregory D ^a   Chu, Cho Wai ^a   Huang, Qing ^a   Caglar, Sadik G ^a  

^a UNIVERSITY OF SAN FRANCISCO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINUX; SWITCHING NETWORKS; TRANSMISSION CONTROL PROTOCOL;

ALLGATHER; DISSEMINATION ALGORITHMS; DUAL PROCESSORS; LINUX CLUSTERS; LOW LATENCY; MYRINET; RECURSIVE DOUBLING;

CLUSTERING ALGORITHMS;

EID: 35248899538     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39924-7_47     Document Type: Review

References (5)

1. Argonne National Laboratory. MPICH - A Portable Implementation of MPI, 2003. http://www-unix.mcs.anl.gov/mpi/mpich/.
2. D. Hensgen, R. Finkel, and U. Manber. Two algorithms for barrier synchronization. International Journal of Parallel Programming, 17(1):1-17, February 1988.
3. Indiana University. LAM / MPI Parallel Computing, 2003. http://www.lam-mpi.org/.
4. Lawrence Berkeley National Laboratory. tcpdump, 2003. http://www.tcpdump.org/.
5. Thomas Worsch, Ralf H. Reussner, and Werner Augustin. On benchmarking collective MPI operations. In J. Volkert, D. Kranzlmüller, and J. J. Dongarra, editors, Recent advances in parallel virtual machine and message passing interface: 9th European PVM/MPI Users' Group Meeting, Linz, Austria, September 29 - October 02, 2002, Lecture Notes in Computer Science, 2002.