Analyzing expected time by scheduler-luck games |
| |
| Authors: | Dolev S Israeli A Moran S |
| |
| Affiliation: | Dept. of Math. & Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva; |
| |
| Abstract: | 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 |
| |
| Keywords: | |
|
|
