Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership
IEEE Transactions on Parallel and Distributed Systems
Automated Rule-Based Diagnosis through a Distributed Monitor System
IEEE Transactions on Dependable and Secure Computing
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A simple and communication-efficient Omega algorithm in the crash-recovery model
Information Processing Letters
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
A general characterization of indulgence
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
From an intermittent rotating star to a leader
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Communication-efficient leader election in crash-recovery systems
Journal of Systems and Software
| Hi-index | 0.00 |
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.