Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing 1999
DOI: 10.1145/301308.301358
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We consider two classes of protocols: deterministic ones and randomized ones.We prove that a non-constant lower bound on the memory space is required by a SSLE protocol on unidirectional, anonymous rings (even if the protocol is randomized).We show that, if there is a deterministic protocol solving a problem on id-based systems where th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
47
0

Year Published

2001
2001
2012
2012

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 55 publications
(49 citation statements)
references
References 17 publications
2
47
0
Order By: Relevance
“…A central daemon is a scheduler that may only select a single processor to schedule from the set of enabled processors. In contrast, a distributed daemon may choose one or more enabled processors at each computation step [13]. A daemon is said to be fair if it will eventually schedule a continuously enabled processor.…”
Section: Daemonsmentioning
confidence: 99%
“…A central daemon is a scheduler that may only select a single processor to schedule from the set of enabled processors. In contrast, a distributed daemon may choose one or more enabled processors at each computation step [13]. A daemon is said to be fair if it will eventually schedule a continuously enabled processor.…”
Section: Daemonsmentioning
confidence: 99%
“…For this, we study to the (eventual) leader election: this problem consists in making the system converge to a configuration from which the same alive process is forever distinguished as the leader. The leader election has been extensively studied in both stabilizing (e.g., [4,5]) and fault-tolerant (e.g., [6,7]) areas.…”
Section: Introductionmentioning
confidence: 99%
“…Several other papers present self-stabilizing token circulation algorithms for anonymous, unidirectional rings: the algorithm of Herman [27] works on synchronous rings of odd size; Duchon, Hanusse and Tixeuil [16] present algorithms for synchronous rings of arbitrary size; Beauquier, Gradinariu and Johnen [4] and Datta, Gradinariu and Tixeuil [13] use several types of tokens and assume the synchronous communication model of shared variables, while the algorithm of Rosaz [44] uses the same idea in asynchronous message passing systems; the algorithms of Kakugawa and Yamashita [36] for asynchronous rings and Johnen [35] for shared memory settings run under unfair distributed schedulers. Of these papers, [4,36,35] require knowledge of ring size.…”
mentioning
confidence: 99%