Analyzing expected time by scheduler-luck games
Shlomi Dolev, Amos Israeli, Shlomo Moran · IEEE Transactions on Software Engineering · 1995
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.>