Analyzing Expected Time by Scheduler-Luck Games

Shlomi Dolev; Amos Israeli; Shlomo Moran

doi:10.1109/32.387472

Analyzing Expected Time by Scheduler-Luck Games

Shlomi Dolev, Amos Israeli, Shlomo Moran

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

33 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	429-439
Number of pages	11
Journal	IEEE Transactions on Software Engineering
Volume	21
Issue number	5
DOIs	https://doi.org/10.1109/32.387472
State	Published - 1 Jan 1995

Keywords

Self-stabilizing systems
leader election
randomized distributed algorithms

ASJC Scopus subject areas

Software

Access to Document

10.1109/32.387472

Cite this

@article{7d8a94a5a175404ea2d28c70eafdff67,

title = "Analyzing Expected Time by Scheduler-Luck Games",

abstract = "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.",

keywords = "Self-stabilizing systems, leader election, randomized distributed algorithms",

author = "Shlomi Dolev and Amos Israeli and Shlomo Moran",

note = "Funding Information: This work was supported in part by the TAMU Engineering Excellence fund and the NSF Presidential Young Investigator Award CCR-9 158478.",

year = "1995",

month = jan,

day = "1",

doi = "10.1109/32.387472",

language = "English",

volume = "21",

pages = "429--439",

journal = "IEEE Transactions on Software Engineering",

issn = "0098-5589",

publisher = "Institute of Electrical and Electronics Engineers",

number = "5",

}

TY - JOUR

T1 - Analyzing Expected Time by Scheduler-Luck Games

AU - Dolev, Shlomi

AU - Israeli, Amos

AU - Moran, Shlomo

N1 - Funding Information: This work was supported in part by the TAMU Engineering Excellence fund and the NSF Presidential Young Investigator Award CCR-9 158478.

PY - 1995/1/1

Y1 - 1995/1/1

N2 - 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.

AB - 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.

KW - Self-stabilizing systems

KW - leader election

KW - randomized distributed algorithms

UR - http://www.scopus.com/inward/record.url?scp=0003390783&partnerID=8YFLogxK

U2 - 10.1109/32.387472

DO - 10.1109/32.387472

M3 - Article

AN - SCOPUS:0003390783

SN - 0098-5589

VL - 21

SP - 429

EP - 439

JO - IEEE Transactions on Software Engineering

JF - IEEE Transactions on Software Engineering

IS - 5

ER -

Analyzing Expected Time by Scheduler-Luck Games

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this