This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Resilient Distributed Algorithms for Ring Election
April 1993 (vol. 4 no. 4)
pp. 475-480

The problem of electing a leader in a dynamic ring in which processors are permitted tofail and recover during election is discussed. It is shown that theta (n log n+k/sub r/)messages, counting only messages sent by functional processors, are necessary andsufficient for dynamic ring election, where k/sub r/ is the number of processor recoveriesexperienced.

[1] H. L. Bodlaender and J. van Leeuwen, "New upperbounds for decentralized extrema-finding in a ring of processors," Tech. Rep. RUU-CS-85-15, Comput. Sci. Dep., Rijksuniversiteit Utrecht, Netherlands, 1985.
[2] J. E. Burns, "A formal model for message passing systems," Tech. Rep. 91, Comput. Sci. Dep., Indiana Univ., Bloomington, IN, 1980.
[3] E. Chang and R. Roberts, "An improved algorithm for decentralized extrema-finding in circular configurations of processes,"Commun. ACM, vol. 22, no. 5, pp. 281-283, 1979.
[4] D. Dolev, M. Klawe, and M. Rodeh, "An O(n log n) unidirectional distributed algorithm for extrema finding in a circle,"J. Algorithms, vol. 3, pp. 245-260, 1982.
[5] R.E. Filman and D.P. Friedman,Coordinated Computing: Tools and Techniques for Distributed Software. New York: McGraw-Hill, 1984, pp. 79-81.
[6] W. R. Franklin, "On an improved algorithm for decentralized extrema finding in circular configurations of processors,"Commun. ACM, vol. 25, pp. 336-337, 1982.
[7] G. N. Frederickson and N. A. Lynch, "The impact of synchronous communication on the problem of electing a leader in a ring," inProc. 16th Annu. ACM Symp. Theory Comput., Washington, DC, 1984, pp. 493-503.
[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] D. S. Hirschberg and J. B. Sinclair, "Decentralized extrema-finding in circular configurations of processors,"Commun. ACM, vol. 23, no. 11, pp. 627-628, 1980.
[10] A. Itai and M. Rodeh, "Symmetry breaking in distributive networks," inProc. 22nd IEEE Symp. Foundations Comput. Sci., Oct. 1981, pp. 150-158.
[11] E. Korach, D. Rotem, and N. Santoro, "Distributed election in a circle without a global sense of orientation,"Int. J. Comput. Math., vol. 14, 1984.
[12] G. LeLann, "Distributed systems - Towards a formal approach,"Information Processing 77. New York: Elsevier Science, 1977, pp. 155-160.
[13] J. Martin,Local Area Networks - Architectures and Implementations. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[14] S. Moran, M. Shalom, and S. Zaks, "A 1.44...nlogn algorithm for distributed leader finding in bidirectional rings of processors," Tech. Rep. 389, Comput. Sci. Dep., Technion, Nov. 1985.
[15] J. Pachl, E. Korach, and D. Rotem, "Lower bounds for distributed maximum-finding algorithms,"J. ACM, vol. 31, pp. 905-918, 1984.
[16] G. L. Peterson, "An O(n log n) unidirectional algorithm for the circular extrema problem,"ACM Trans. Programming Languages Syst., vol. 4, pp. 758-762, 1982.
[17] D. Rotem, E. Korach, and N. Santoro, "Analysis of a distributed algorithm for extrema finding in a ring," Tech. Rep. SCS-TR-61, School of Comput. Sci., Carleton Univ., Aug. 1984.
[18] P. M. B. Vitanyi, "Distributed election in an Archimedean ring of processors," inProc. 16th Annu. ACM Symp. Theory Comput., Washington, DC, 1984, pp. 542-547.

Index Terms:
Index Termsmessage complexity; distributed algorithms; ring election; dynamic ring; processorrecoveries; computational complexity; multiprocessing systems; system recovery
Citation:
M.Y. Chan, F.Y.L. Chin, "Optimal Resilient Distributed Algorithms for Ring Election," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 4, pp. 475-480, April 1993, doi:10.1109/71.219762
Usage of this product signifies your acceptance of the Terms of Use.