Optimal and Near-Optimal Algorithms fork-Item Broadcast

Journal of Parallel and Distributed Computing

Volumn 57, Issue 2, 1999, Pages 121-139

  Santos, Eunice E ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000679818     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1999.1529     Document Type: Article

References (12)

1. Alon N., Barak A., Manber U. On disseminating information reliably without broadcasting. Proc. International Conf. on Distributed Computing Systems. 1987.
2. Bar-Noy A., Kipnis S. Designing broadcasting algorithms in the postal model for message- passing systems. Proc. ACM Symposium on Parallel Algorithms and Architectures. June 1992;. p. 11-22.
3. Bertsekas D. P., Tsitsiklis J. N. Parallel and Distributed Computation: Numerical Methods. 1989;Prentice-Hall, New York.
4. Chinn P., Hedetniemi S., Mitchell S. Multiple-message broadcasting in complete graphs. Proc. 10 th SE Conf. on Combinatorics, Graph Theory and Computing. 1979.
5. Cockayne E., Thomason A. Optimal multi-message broadcasting in complete graphs. Proc. 11 th SE Conf. on Combinatorics, Graph Theory, and Computing. 1980;. p. 181-199.
6. Culler D. E., Karp R. M., Patterson D. A., Sahay A., Santos E. E., Schauser K. E., Subramonian R., von Eicken T. LogP: A practical model of parallel computation. Commun. ACM. November 1996.
7. Farley A. M. Broadcast time in communication networks. SIAM J. Appl. Math. 39:1980;385-390.
8. Hedetniemi S. M., Hedetniemi S. T., Liestman A. L. A survey of gossiping and broadcasting in communication networks. Networks. 18:1988;319-349.
9. Ho C.-T. Optimal Communication Primitives and Graph Embeddings on Hypercubes. 1990;Yale University.
10. Ho C.-T., Johnsson S. L. Distributed routing algorithms for broadcasting and personalized communication in hypercubes. Proc. 1986 International Conf. on Parallel Processing. IEEE Computer Society. 1986;. p. 640-648.
11. Karp R. M., Sahay A., Santos E., Schauser K. E. Optimal broadcast and summation in the LogP model. Proc. ACM Symposium on Parallel Algorithms and Architectures. ACM. 1993.
12. Santos E. E. Efficient Algorithms for Broadcast, Prefix Summing and Matrix Computation for Distributed-Memory Machines. 1995;University of California, Berkeley.