Optimal broadcast for fully connected networks

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

Volumn 3726 LNCS, Issue , 2005, Pages 45-56

  Träff, Jesper Larsson ^a   Ripke, Andreas ^a  

^a NEC LABORATORIES EUROPE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COSTS; PROGRAM PROCESSORS;

BINARY TREE ALGORITHM; BROADCAST ALGORITHM; FULLY CONNECTED NETWORKS;

BROADCASTING;

EID: 33646420862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557654_8     Document Type: Conference Paper

References (16)

1. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. J. Scheiman. LogGP: Incorporating long messages into the LogP model for parallel computation. Journal of Parallel and Distributed Computing, 44(1):71-79, 1997.
2. F. Cappello, P. Fraigniaud, B. Mans, and A. L. Rosenberg. HiHCoHP: Toward a realistic communication model for Hierarchical HyperClusters of Heterogeneous Processors. In 15th International Parallel and Distributed Processing Symposium (IPDPS01), pages 42-47, 2001.
3. E. W. Chan, M. F. Heimlich, A. Purkayastha, and R. A. van de Geijn. On optimizing collective communication. In Cluster 2004, 2004.
4. D. E. Culler, R. M. Karp, D. Patterson, A. Sahay, E. E. Santos, K. E. Schauser, R. Subramonian, and T. von Eicken. LogP: A practical model of parallel computation. Communications of the ACM, 39(11):78-85, 1996.
5. P. Fraigniaud and E. Lazard. Methods and problems of communication in usual networks. Discrete Applied Mathematics, 53(1-3):79-133, 1994.
6. M. Golebiewski, H. Ritzdorf, J. L. Träff, and F. Zimmermann. The MPI/SX implementation of MPI for NEC's SX-6 and other NEC platforms. NEC Research & Development, 44(1):69-74, 2003.
7. S. M. Hedetniemi, T. Hedetniemi, and A. L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319-349, 1988.
8. S. L. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Transactions on Computers, 38(9):1249-1268, 1989.
9. S. Juhász and F. Kovács. Asynchronous distributed broadcasting in cluster environment. In Recent Advances in Parallel Virtual Machine and Message Passing Interface, 11th European PVM/MPI Users' Group Meeting, volume 3241 of Lecture Notes in Computer Science, pages 164-172, 2004.
10. P. Sanders and J. F. Sibeyn. A bandwidth latency tradeoff for broadcast and reduction. Information Processing Letters, 86(1):33-38, 2003.
11. E. E. Santos. Optimal and near-optimal algorithms for k-item broadcast. Journal of Parallel and Distributed Computing, 57(2): 121-139, 1999.
12. M. Snir, S. Otto, S. Huss-Lederman, D, Walker, and J. Dongarra. MPI - The Complete Reference, volume 1, The MPI Core. MIT Press, second edition, 1998.
13. R. Thakur, W. D. Gropp, and R. Rabenseifher. Improving the performance of collective operations in MPICH. International Journal on High Performance' Computing Applications, 19:49-66, 2004.
14. J.-Y. Tien, C.-T. Ho, and W.-P. Yang. Broadcasting on incomplete hypercubes. IEEE Transactions on Computers, 42(11):1393-1398, 1993.
15. J. L. Träff. A simple work-optimal broadcast algorithm for message passing parallel systems. In Recent Advances in Parallel Virtual Machine and Message Passing Interface. 11th European PVM/MPI Users' Group Meeting, volume 3241 of Lecture Notes in Computer Science, pages 173-180, 2004.
16. J. L. Träff and A. Ripke. An optimal broadcast algorithm adapted to SMP-clusters. In Recent Advances in Parallel Virtual Machine and Message Passing Interface. 12th European PVM/MPI Users' Group Meeting, volume 3666 of Lecture Notes in Computer Science, 2005.