
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Shlomi Dolev, Amos Israeli, Shlomo Moran, "Uniform Dynamic SelfStabilizing Leader Election," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 4, pp. 424440, April, 1997.  
BibTex  x  
@article{ 10.1109/71.588622, author = {Shlomi Dolev and Amos Israeli and Shlomo Moran}, title = {Uniform Dynamic SelfStabilizing Leader Election}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {4}, issn = {10459219}, year = {1997}, pages = {424440}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.588622}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Uniform Dynamic SelfStabilizing Leader Election IS  4 SN  10459219 SP424 EP440 EPD  424440 A1  Shlomi Dolev, A1  Amos Israeli, A1  Shlomo Moran, PY  1997 KW  Selfstabilizing systems KW  leader election KW  distributed algorithms KW  randomized distributed algorithms KW  synchronization. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—A distributed system is
[1] K. Abrahamson,A. Adler,L. Higham,, and D. Kirkpatrick,“Probabilistic solitude verification on a ring,” Proc. Fifth Ann. ACM Symp. on Principles of Distributed Computing,Quebec City, Aug. 1986 pp. 161173.
[2] H. Attiya,M. Snir,, and M. Warmuth,“Computing on an anonymous ring,” J. ACM, vol. 35, no. 4, pp. 845875, Oct. 1988.
[3] K. Abrahamson,“On achieving consensus using a shared memory,” Proc. Seventh Ann. ACM Symp. Principles Distributed Computing,Toronto, Canada, pp. 291302, Aug. 1988.
[4] E. Angnostou and R. ElYaniv,“More on the power of random walks: Uniform selfstabilizing algorithms,” Lecture Notes in Computer Science 579: Distributed Algorithms, S. Toueg, P.G. Spirakis, and L. Kirousis, eds., pp. 3151, SpringerVerlag, 1992.
[5] A. Arora and M. Gouda:, “Distributed reset,” Lecture Notes inComputer Science 472: Foundations of Software Technology and TheoreticalComputer Science, K.V. Nori and C.E. Veni Madhavan, eds., pp. 316331, SpringerVerlag, 1990.
[6] Y. Afek,S. Kutten,, and M. Yung,“Memoryefficient selfstabilization on general networks,” Lecture Notes in Computer Science 486: Distributed Algorithms, J. Van Leeuwen and N. Santoro, eds., pp. 1528, SpringerVerlag, 1991.
[7] Y. Afek, S. Kutten, and M. Yung, "Local Detection for Global SelfStabilization," preprint.
[8] B. Awerbuch and G. Varghese, "Distributed Program Checking a Paradigm for Building SelfStabilizing Distributed Protocols," Proc. 31st Ann. IEEE Symp. Foundations of Computer Science, pp. 268277, 1991.
[9] B. Awerbuch, “Complexity of Network Synchronization,” J. ACM, vol. 32, pp. 804–823, 1985.
[10] G.M. Brown, M.G. Gouda, and C.L. Wu, "A SelfStabilizing Token System," Proc. 20th Ann. Hawaii Int'l Conf. System Sciences, pp. 218223, 1987.
[11] J.E. Burns and J. Pachl,“Uniform selfstabilizing rings,” ACM Trans. Programming Languages and Systems, vol. 11, no. 2, pp. 330344, Apr. 1989,.
[12] J.E. Burns, "SelfStabilizing Rings Without Demons," Technical Report GITICS8736, Georgia Inst. of Tech nology.
[13] B.S. Chlebus, K. Diks, and A. Pelc, "Fast Gossiping With Short Unreliable Messages," Discrete Applied Math., special issue on gossiping, vol. 53, pp. 1524, 1994.
[14] E.W. Dijkstra,“Selfstabilizing systems in spite of distributed control,” Comm. ACM, vol. 17, no. 11 pp. 643644, 1974,.
[15] S. Dolev, A. Israeli, and S. Moran, "Self Stabilization of Dynamic Systems," Proc. Ninth Ann. ACM Symp. Principles of Distributed Computing,Quebec City, pp. 103118, Aug. 1990. Distributed Computting vol. 7, pp. 316, 1993.
[16] S. Dolev,A. Israeli,, and S. Moran,“Uniform dynamic selfstabilizing leader election,” Lecture Notes in Computer Science 579: Distributed Algorithms, S. Toueg, P.G. Spirakis, and L. Kirousis, eds., pp. 163180, SpringerVerlag, 1992.
[17] S. Dolev, A. Israeli, and S. Moran, "Analyzing Expected Time by SchedulerLuck Games," IEEE Trans. Software Eng., vol. 21, no. 5, pp. 429439, May 1995.
[18] R.G. Gallager, "Finding a Leader in Networks With O(E) + O(N log N) Messages," Internal Memo., M.I.T., Cambridge, Mass., 1978.
[19] S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A Survey of Gossiping and Broadcasting in Comm. Networks," Networks, vol. 18, pp. 319349, 1988.
[20] P. Humblet, "Selecting a Leader in a Clique in O(N log n) Messages. Internal Memo., Laboratory for Information and Decision Systems, M.I.T., Cambridge, Mass., 1984.
[21] A. Israeli and M. Jalfon,“Token management schemes and random walks yield selfstabilizing mutual exclusion,” Proc. Ninth Ann. ACM Symp. Principles of Distributed Computation,Quebec City, Aug. 1990, pp. 119132.
[22] A. Israeli and M. Jalfon,“Selfstabilizing ring orientation,” Lecture Notes in Computer Science 486: Distributed Algorithms, J. Van Leeuwen and N. Santoro, eds., pp. 114, SpringerVerlag, 1991.
[23] A. Itai and M. Rodeh,“Probabilistic methods for breaking symmetry in distributed networks,” Information and Computation, vol. 88, no. 1, pp. 6087, 1990.
[24] E. Korach,S. Kutten,, and S. Moran,“A modular technique for the design of efficient distributed leader finding algorithms,” ACM Trans. Programming Languages and Systems, vol. 12, no. 1, pp. 8410, 1990.
[25] E. Korach,S. Moran,, and S. Zaks,“Tight lower and upper bounds for some distributed algorithms for completenetwork of processors,” Proc. Third Ann. ACM Symp. Principles of Distributed Computing, pp. 199207, 1984.
[26] S. Katz and K. J. Perry,“Selfstabilizing extensions for messagepassing systems,” Proc. Ninth Ann. ACM Symp. Principles of Distributed Computing,Quebec City, pp. 91101, Aug. 1990.
[27] L. Lamport,“The mutual exclusion problem: Part IIStatement and solutions,” J. Assoc. for Computing Machinery, vol. 33, no. 2, pp. 327348, 1986.
[28] Y. Matias and Y. Afek, "Simple and Efficient Election Algorithms for Anonymous Networks," manuscript, 1989.
[29] A. Segall, "Distributed Networks Protocols," IEEE Trans. Comm., vol. 29, no. 1, pp. 2335, Jan. 1983.
[30] B. Schieber and M. Snir,“Calling names on nameless networks,” Proc. Eighth Ann. ACM Symp. Principles of Distributed Computing,Edmonton, pp. 319328, Aug. 1989.
[31] M. Tchuente, "Sur l'autostabilisation dans un réseau d'ordinateurs," RAIRO Inf. Theor., vol. 15, pp. 4766, 1981.