Issue No. 05 - May (1995 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.387472
In this paper we introduce a novel technique, the <it>scheduler luck game</it> (in short <it>sl-game</it>) 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 <it>sl-game</it> technique.
Self-stabilizing systems, leader election, randomized distributed algorithms.
A. Israeli, S. Moran and S. Dolev, "Analyzing Expected Time by Scheduler-Luck Games," in IEEE Transactions on Software Engineering, vol. 21, no. , pp. 429-439, 1995.