|
Published Articles >> Table of Contents >> Abstract
23rd IEEE International Symposium on Reliable Distributed Systems (SRDS'04)
pp. 208-217
Crash-Resilient Time-Free Eventual Leadership
Achour Mostefaoui, IRISA, France
Michel Raynal, IRISA, France
Corentin Travers, IRISA, France
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RELDIS.2004.1353022
Send link to a friend
| Abstract |
|
Leader-based protocols rest on a primitive able to provide the processes with the same unique leader. Such protocols are very common in distributed computing to solve synchronization or coordination problems. Unfortunately, providing such a primitive is far from being trivial in asynchronous distributed systems prone to process crashes. (It is even impossible in fault-prone purely asynchronous systems.) To circumvent this difficulty, several protocols have been proposed that build a leader facility on top of an asynchronous distributed system enriched with synchrony assumptions. This paper consider another approach to build a leader facility, namely, it considers a behavioral property on the flow of messages that are exchanged. This property has the noteworthy feature not to involve timing assumptions. Two protocols based on this time-free property that implement a leader primitive are described. The first one uses potentially unbounded counters, while the second one (which is a little more involved) requires only finite memory. These protocols rely on simple design principles that make them attractive, easy to understand and provably correct.
|
 Additional Information
|
Index Terms- Asynchronous system, Distributed algorithm, Fault tolerance, Leader, Process crash, Time-free Protocol
Citation:
Achour Mostefaoui, Michel Raynal, Corentin Travers,
"Crash-Resilient Time-Free Eventual Leadership,"
srds,
pp. 208-217,
23rd IEEE International Symposium on Reliable Distributed Systems (SRDS'04),
2004
|
|
