This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analyzing Expected Time by Scheduler-Luck Games
May 1995 (vol. 21 no. 5)
pp. 429-439
In this paper we introduce a novel technique, the scheduler luck game (in short sl-game) for analyzing the performance of randomized distributed protocols. We apply it in studying uniform self-stabilizing protocols for leader election under read/write atomicity. We present two protocols for the case where each processor in the system can communicate with all other processors and analyze their performance using the sl-game technique.

[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. 161-173.
[2] H. Attiya,M. Snir,, and M. Warmuth,“Computing on an anonymous ring,” J. ACM, vol. 35, no. 4, pp. 845-875, Oct. 1988.
[3] K. Abrahamson,“On achieving consensus using a shared memory,” Proc. Seventh Ann. ACM Symp. Principles Distributed Computing,Toronto, Canada, pp. 291-302, Aug. 1988.
[4] E. Angnostou and R. El-Yaniv,“More on the power of random walks: Uniform self-stabilizing algorithms,” Lecture Notes in Computer Science 579: Distributed Algorithms, S. Toueg, P.G. Spirakis, and L. Kirousis, eds., pp. 31-51, Springer-Verlag, 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. 316-331, Springer-Verlag, 1990.
[6] Y. Afek,S. Kutten,, and M. Yung,“Memory-efficient self-stabilization on general networks,” Lecture Notes in Computer Science 486: Distributed Algorithms, J. Van Leeuwen and N. Santoro, eds., pp. 15-28, Springer-Verlag, 1991.
[7] Y. Afek,S. Kutten, and M. Yung,“Local detection for global self-stabilization,” preprint.
[8] G.M. Brown,M.G. Gouda,, and C.L. Wu,“A self-stabilizing token system,” Proc. 20th Ann. Hawaii Int’l Conf. System Sciences 1987, pp. 218-223.
[9] J.E. Burns and J. Pachl,“Uniform self-stabilizing rings,” ACM Trans. Programming Languages and Systems, vol. 11, no. 2, pp. 330-344, Apr. 1989,.
[10] J.E. Burns,“Self-stabilizing rings without demons,” Technical Report GIT-ICS-87/36, Georgia Inst. Technology.
[11] B. Chor, and B. Coan,“A simple and efficient randomized Byzantine agreement algorithm,” IEEE Trans. Software Engineering, vol. 11, no. 6, pp. 531-539, 1985.
[12] E.W. Dijkstra,“Self-stabilizing systems in spite of distributed control,” Comm. ACM, vol. 17, no. 11 pp. 643-644, 1974,.
[13] S. Dolev,A. Israeli,, and S. Moran,“Uniform dynamic self-stabilizing leader election,” Lecture Notes in Computer Science 579: Distributed Algorithms, S. Toueg, P.G. Spirakis, and L. Kirousis, eds., pp. 163-180, Springer-Verlag, 1992.
[14] S. Dolev,A. Israeli,, and S. Moran,“Self stabilization of dynamic systems assuming only read/write atomicity,” Distributed Computing, vol. 7, pp. 3-16, 1993.
[15] S. Dolev,A. Israeli,, and S. Moran,“Uniform self-stabilizing leader election, Part 1: Complete graph protocol,” Technical Report 94-807, Computer Science Dept., Technion, Israel
[16] S. Dolev,A. Israeli,“Uniform self-stabilizing leader election, Part 2: General graph protocol,” Technical Report 94-039, Dept. of Computer Science, Texas A&M Univ.
[17] S. Dolev,“Optimal time self-stabilization in uniform dynamic systems,” Sixth IASTED Int’l Conf. Parallel and Distributed Computing and Systems, pp. 25-28, 1994.
[18] S. Dolev, and J.L. Welch,“Wait-free clock synchronization,” Proc. 12th Ann. ACM Symp. Principles of Distributed Computing, pp. 97-108, 1993.
[19] R. G. Gallager,“Finding a leader in networks with O(E) + O(N log N)messages,” Internal Memo., M.I.T., Cambridge, Mass., 1978.
[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 self-stabilizing mutual exclusion,” Proc. Ninth Ann. ACM Symp. Principles of Distributed Computation,Quebec City, Aug. 1990, pp. 119-132.
[22] A. Israeli and M. Jalfon,“Self-stabilizing ring orientation,” Lecture Notes in Computer Science 486: Distributed Algorithms, J. Van Leeuwen and N. Santoro, eds., pp. 1-14, Springer-Verlag, 1991.
[23] A. Itai and M. Rodeh,“Probabilistic methods for breaking symmetry in distributed networks,” Information and Computation, vol. 88, no. 1, pp. 60-87, 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. 84-10, 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. 199-207, 1984.
[26] S. Katz and K. J. Perry,“Self-stabilizing extensions for message-passing systems,” Proc. Ninth Ann. ACM Symp. Principles of Distributed Computing,Quebec City, pp. 91-101, Aug. 1990.
[27] L. Lamport,“The mutual exclusion problem: Part II-Statement and solutions,” J. Assoc. for Computing Machinery, vol. 33, no. 2, pp. 327-348, 1986.
[28] Y. Matias and Y. Afek,“Simple and efficient election algorithms for anonymous networks,” manuscript, 1989.
[29] B. Schieber and M. Snir,“Calling names on nameless networks,” Proc. Eighth Ann. ACM Symp. Principles of Distributed Computing,Edmonton, pp. 319-328, Aug. 1989.
[30] M. Tchuente,“Sur l’auto-stabilisation dans un réseau d’ordinateurs,” RAIRO Inf. Theor. 15, pp. 47-66, 1981.

Index Terms:
Self-stabilizing systems, leader election, randomized distributed algorithms.
Citation:
Shlomi Dolev, Amos Israeli, Shlomo Moran, "Analyzing Expected Time by Scheduler-Luck Games," IEEE Transactions on Software Engineering, vol. 21, no. 5, pp. 429-439, May 1995, doi:10.1109/32.387472
Usage of this product signifies your acceptance of the Terms of Use.