This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
April 1988 (vol. 37 no. 4)
pp. 449-453
Electron in asynchronous complete networks is considered for the case in which the links may fail intermittently and undetectably. Undetectable link failure is consistent with the standard model of distributed algorithms in which link delays can be arbitrary but finite. An algorithm is given that correctly solves the problem when the links fail before or during the execution of the algorithm. I

[1] H. H. Abu-Amara, "Fault-tolerant distributed algorithms," Ph.D. dissertation, Univ. Illinois, Urbana-Champaign, to appear.
[2] Y. Afek and E. Gafni, "Time and message bounds for election in synchronous and asynchronous complete networks," inProc. 4th ACM Symp. Principles Distributed Comput., Minacki, Ont., Canada, Aug. 1985, pp. 186-195.
[3] P. A. Alsberg and J. D. Day, "A principle for resilient sharing of distributed resources," inProc. 2nd Int. Conf. Software Eng., San Franscisco, CA, Oct. 1976, pp. 562-570.
[4] R. Bar-Yehuda, S. Kutten, Y. Wolfstahl, and S. Zaks, "Making distributed spanning tree algorithms fault-resilient," inProc. 4th Symp. Theoret. Aspects Comput. Sci., Passau, Germany, Feb. 1987, pp. 432-444.
[5] I. A. Cimet and P. R. S. Kumar, "A resilient distributed protocol for network synchronization," inACM SIGCOMM Symp. Commun. Arch. Protocols, Stowe, VT, Aug. 1986, pp. 358-367.
[6] M. J. Fischer, N. A. Lynch, and M. S. Paterson, "Impossibility of distributed consensus with one faulty process,"J. ACM, vol. 32, no. 2, pp. 374-382, Apr. 1985.
[7] E. Gafni, "Improvements in the complexity of two message-optimal election algorithms," inProc. 4th ACM Symp. Principles Distributed Comput., Minacki, Ont., Canada, Aug. 1985, pp. 175-185.
[8] O. Goldreich and L. Shrira, "The effect of link failures on computations in asynchronous rings," inProc. 5th ACM Symp. Principles Distributed Comput., Calgary, Alta., Canada, Aug. 1986, pp. 174- 185.
[9] E. Korach, S. Moran, and S. Zaks, "Tight lower and upper bounds for some distributed algorithms for a complete network of processors," inProc. 3rd ACM Symp. Principles Distributed Comput., Vancouver, B.C., Canada, Aug. 1984, pp. 199-207.
[10] M. C. Loui, T. A. Matsushita, and D. B. West, "Election in complete networks with a sense of direction,"Inform. Processing Lett., vol. 22, pp. 185-187, Apr. 1986.
[11] D. A. Menasce, G. J. Popek, and R. R. Muntz, "A locking protocol for resource coordination in distributed databases,"ACM Trans. Database Syst., vol. 5, pp. 103-138, June 1980.
[12] G. L. Peterson, "Efficient algorithms for elections in meshes and complete networks," Tech. Rep. TR-140, Univ. Rochester, July 1985.
[13] R. D. Schlichting and F.B. Schneider, "Fail-stop processors: An approach to designing fault-tolerant computing systems,"ACM Trans. Comput. Syst., vol. 1, no. 3, pp. 222-238, Aug. 1983.

Index Terms:
fault tolerant distributed algorithms; undetected link failure; election; complete networks; design parameter; node identifiers; computer networks; distributed processing; fault tolerant computing.
Citation:
H.-H. Abu-Amara, "Fault-Tolerant Distributed Algorithm for Election in Complete Networks," IEEE Transactions on Computers, vol. 37, no. 4, pp. 449-453, April 1988, doi:10.1109/12.2189
Usage of this product signifies your acceptance of the Terms of Use.