Broadcasting with a Bounded Fraction of Faulty Nodes

Journal of Parallel and Distributed Computing

Volumn 42, Issue 1, 1997, Pages 11-20

  Gasieniec, Leszek ^a   Pelc, Andrzej ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (23)

1. Anderson R. J., Miller G. L. Optical communication for pointer based algorithms. Tech. Report. CRI 88-14:1988.
2. Berman K. A., Hawrylycz M. Telephone problems with failures. SIAM J. Alg. Discrete Meth. 7:1986;13-17.
3. Bienstock D. Broadcasting with random faults. Discrete Appl. Math. 20:1988;1-7.
4. B. S. Chlebus, K. Diks, A. Pelc, Sparse networks supporting efficient reliable broadcasting, Proc. ICALP'93, Lecture Notes in Computer Science, 700, 388, 397.
5. B. S. Chlebus, K. Diks, A. Pelc, 1991, Optimal broadcasting in faulty hypercubes, Digest of Papers, FTCS'21, 266, 273.
6. Fraigniaud P., Lazard E. Methods and problems of communication in usual networks. "Special Issue on Broadcasting and Gossiping" Discrete Appl. Math. 53:1994;79-133.
7. Gargano L. Tighter bounds on fault-tolerant broadcasting and gossiping. Networks. 22:1992;469-486.
8. Gargano L., Liestman A. L., Peters J., Richards D. Reliable broadcasting. Discrete Appl. Math. 53:1994;135-148.
9. Gargano L., Rescigno A. A., Vaccaro U. Fault-tolerant hypercube broadcasting via information dispersal. Networks. 23:1993;271-282.
10. Gargano L., Vaccaro U. Minimum time networks tolerating a logarithmic number of faults. SIAM J. Discrete Math. 5:1992;178-198.
11. Gargano L., Vaccaro U. Problem 8. Parallel Processing Letters. 3:1993;507-524.
12. M. Geréb-Graus, T. Tsantilas, 1992, Efficient optical communication in parallel computers, Proceedings of the 4th Ann. ACM Symposium on Parallel Algorithms and Architectures, 41, 48.
13. L. A. Goldberg, M. Jerrum, F. T. Leighton, S. B. Rao, 1993, A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer, Proceedings of the 5th Ann. ACM Symposium on Parallel Algorithms, 300, 309.
14. Haddad R. W., Roy S., Schäffer A. A. On gossiping with faulty telephone lines. SIAM J. Alg. Discrete Meth. 8:1987;439-445.
15. Hedetniemi S. M., Hedetniemi S. T., Liestman A. L. A survey of gossiping and broadcasting in communication networks. Networks. 18:1988;319-349.
16. Kruskal C. P., Rudolph L., Snir M. A complexity theory of efficient parallel algorithms. Theoret. Comput. Sci. 71:1990;95-132.
17. Liestman A. L. Fault-tolerant broadcast graphs. Networks. 15:1985;159-171.
18. McColl W. F. General purpose parallel computing. Gibbons A., Spirakis P. Lectures on Parallel Computation. 1993;337-391 Cambridge Univ. Press, Cambridge.
19. Meyer auf der Heide F. Hashing strategies for simulating shared memory on distributed memory machines. Meyer auf der Heide F., Monien B., Rosenberg A. L. Proceedings of the 1st Heinz Nixdorf Symposium "Parallel Architectures and their Efficient Use" Lecture Notes in Computer Science. 678:1992;20-29 Paderborn.
20. Peleg D., Schäffer A. A. Time bounds on fault-tolerant broadcasting. Networks. 19:1989;803-822.
21. Ramanathan P., Shin K. G. Reliable broadcast in hypercube multicomputers. IEEE Trans. Comput. 37:1988;1654-1657.
22. Rao S. B. Properties of an interconnection architecture based on wavelength division multiplexing. Technical Report. TR-92-009-3-0054-2:1992.
23. Scheinerman E. R., Wierman J. C. Optimal and near-optimal broadcast in random graphs. Discrete Appl. Math. 25:1989;289-297.