Optimal adaptive broadcasting with a bounded fraction of faulty nodes

Algorithmica (New York)

Volumn 28, Issue 1, 2000, Pages 37-50

  Diks, K ^a   Pelc, A ^b  

^a UNIVERSITY OF WARSAW   (Poland)

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

Author keywords

Adaptive; Algorithm; Broadcasting; Diagnosis; Fault

Indexed keywords

EID: 0012526484     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010030     Document Type: Article

References (33)

1. A. Bagchi and S.L. Hakimi, Information dissemination in distributed systems with faulty units, IEEE Trans. Comput. 43 (1994), 698-710.
2. R. Beigel, W. Hurwood, and N. Kahale, Fault diagnosis in a flash, Proc. 36th Symp. Found. Comput. Sci., 1995, pp. 571-580.
3. R. Beigel, S.R. Kosaraju, and G.F. Sullivan, Locating faults in a constant number of testing rounds, Proc. 1st Ann. ACM Symp. Parallel Algorithms Arch., 1989, pp. 189-198.
4. R. Beigel, G. Margulis, and D.A. Spielman, Fault diagnosis in a constant number of parallel testing rounds, Proc. 5th Ann. ACM Symp. Parallel Algorithms Arch., 1993, pp. 21-29.
5. K.A. Berman and M. Hawrylycz, Telephone problems with failures, SIAM J. Algebraic Discrete Methods 7 (1986), 13-17.
6. P. Berman and A. Pelc, Reliable distributed diagnosis for multiprocessor systems with random faults, Networks 24 (1994), 417-427.
7. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989.
8. P. Berman, K. Diks, and A. Pelc, Reliable broadcasting in logarithmic time with Byzantine link failures, J. Algorithms 22 (1977), 199-211.
9. P.M. Blecher, On a logical problem, Discrete Math. 43 (1983), 107-110.
10. B.S. Chlebus, L. Ga̧sieniec, and A. Pelc, Fast deterministic simulation of computations on faulty parallel machines, Proc. Third Ann. European Symp. Algorithms, ESA '95, Corfu, Greece, September 1995, LNCS 979, Springer-Verlag, Berlin, 1995, pp. 89-101.
11. A.T. Dahbura, System-level diagnosis: a perspective for the third decade, in: Concurrent Compulation: Algorithms, Architectures, Technologies, Plenum, New York, 1988.
12. A. Farley, Reliable minimum-time broadcast networks, Proc. 18th SE Conf. Combin., Graph Theory Comput., Congressus Numerantium 59, 1987, pp. 37-48.
13. G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon and D. Walker, Solving Problems on Concurrent Processors, Volume I, Prentice-Hall, Englewood Cliffs, NJ, 1988.
14. P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Appl. Math. 53 (1994), 79-133.
15. L. Gargano, Tighter bounds on fault-tolerant broadcasting and gossiping, Networks 22 (1992), 469-486.
16. L. Gargano and U. Vaccaro, Minimum time networks tolerating a logarithmic number of faults, SIAM J. Discrete Math. 5 (1992), 178-198.
17. L. Ga̧sieniec and A. Pelc, Adaptive broadcasting with faulty nodes, Parallel Comput. 22 (1996), 903-912.
18. L. Ga̧sieniec and A. Pelc, Broadcasting with linearly bounded transmission faults, Discrete Appl. Math. 82 (1998), 119-131.
19. R.W. Haddad, S. Roy, and A.A. Schäffer, On gossiping with faulty telephone lines, SIAM J. Algebraic Discrete Methods 8 (1987), 439-445.
20. S.L. Hakimi and K. Nakajima, On adaptive system diagnosis, IEEE Trans. Comput. 33 (1984), 234-240.
21. S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319-349.
22. J. Hromkovič, R. Klasing, B. Monien, and R. Peine, Dissemination of information in interconnection networks (broadcasting and gossiping), in: F. Hsu and D.-Z. Du (eds.), Combinatorial Network Theory, Kluwer, Dordrecht, 1996, pp. 125-212.
23. S.L. Johnsson and C.T. Ho, Matrix multiplication on Boolean cubes using generic communication primitives, in: Parallel Processing and Medium-Scale Multiprocessors, A. Wouk (ed.), SIAM, Philadelphia, PA, 1989, pp. 108-156.
24. J.G. Kuhl and S.M. Reddy, Distributed fault-tolerance for large multiprocessor systems, Proc. IEEE Symp. Comput. Architecture, 1980, pp. 23-30.
25. A. Lubotzky, R. Philips, and P. Sarnak, Explicit expanders and the Ramanujan conjectures, Proc. 18th Ann. ACM Symp. Theory Comput., Berkeley, CA, May 1986, pp. 247-263.
26. K. Nakajima, A new approach to system diagnosis, Proc. 19th Allerton Conf. Commun. Control Comput., 1981, pp. 697-706.
27. A. Pelc, Efficient distributed diagnosis in the presence of random faults, Proc. 23rd Internat. Symp. Fault-Tolerant Comput., 1993, pp. 462-469.
28. A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996), 143-156.
29. D. Peleg and A.A. Schäffer, Time bounds on fault-tolerant broadcasting, Networks 19 (1989), 803-822.
30. F. Preparata, G. Metze, and R. Chien, On the connection assignment problem of diagnosable systems, IEEE Trans. Electron. Comput. 16 (1967), 848-854.
31. E. Schmeichel, S.L. Hakimi, M. Otsuka, and G. Sullivan, On minimizing testing rounds for fault identification. Dig. 18th Internat. Symp. Fault-Tolerant Comput., IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 266-271.
32. E. Upfal, Tolerating a linear number of faults in networks of bounded degree, Inform. and Comput. 115 (1994), 312-320.
33. V.G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz. 3 (1964), 25-30.