Abstract
Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumptions that such a system has to satisfy for a common leader to be eventually elected is one of the holy grail quests of fault-tolerant asynchronous computing. This paper is a step in such a quest. It has two main contributions. First, it proposes an asynchronous system model, in which an eventual leader can be elected, that is weaker and more general than previous models. This model is captured by the notion of intermittent rotating t -star. An x-star is a set of x + 1 processes: a process p (the center of the star) plus a set of x processes (the points of the star). Intuitively, assuming logical times rn (round numbers), the intermittent rotating t -star assumption means that there are a process p, a subset of the round numbers rn, and associated sets Q(rn) such that each set {p} ∪ Q(rn) is a t-star centered at p, and each process of Q(rn) receives from p a message tagged rn in a timely manner or among the first (n − t) messages tagged rn it ever receives. The star is called t-rotating because the set Q(rn) is allowed to change with rn. It is called intermittent because the star can disappear during finite periods. This assumption, not only combines, but generalizes several synchrony and time-free assumptions that have been previously proposed to elect an eventual leader (e.g., eventual t-source, eventual t-moving source, message pattern assumption). Each of these assumptions appears as a particular case of the intermittent rotating t -star assumption. The second contribution of the paper is an algorithm that eventually elects a common leader in any system that satisfies the intermittent rotating t -star assumption. That algorithm enjoys, among others, two noteworthy properties. Firstly, from a design point of view, it is simple. Secondly, from a cost point of view, only the round numbers can increase without bound. This means that, be the execution finite or infinite, be links timely or not (or have the corresponding sender crashed or not), all the other local variables (including the timers) and message fields have a finite domain.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On Implementing Omega with Weak Reliability and Synchrony Assumptions. In: 22th ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 306–314 (2003)
Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication Efficient Leader Election and Consensus with Limited Link Synchrony. In: 23th ACM Symp. on Principles of Distributed Computing (PODC 2004), pp. 328–337 (2004)
Chandra, T.D., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM 43(2), 225–267 (1996)
Chandra, T.D., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM 43(4), 685–722 (1996)
Fernández, A., Jiménez, E., Raynal, M.: Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony. In: Proc. Int’l IEEE conference on Dependable Systems and Networks (DSN 2006), pp. 166–175 (2006)
Fernández, A., Raynal, M.: From an Intermittent Rotating Star to a Leader. Tech Report 1810, IRISA, Rennes (2006)
Fischer, M.J., Lynch, N., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32(2), 374–382 (1985)
Guerraoui, R.: Indulgent Algorithms.In: 19th ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 289–298 (2000)
Guerraoui, R., Raynal, M.: The Information Structure of Indulgent Consensus. IEEE Transactions on Computers 53(4), 453–466 (2004)
Hélary, J.-M., Mostéfaoui, A., Raynal, M.: Interval Consistency of Asynchronous Distributed Computations. Journal of Computer and System Sciences 64(2), 329–349 (2002)
Hutle, M., Malkhi, D., Schmid, U., Zhou, L.: Chasing the weakest system model for implementing Ω and consensus. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 576–577. Springer, Heidelberg (2006)
Jiménez, E., Arévalo, S., Fernández, A.: Implementing unreliable failure detectors with unknown membership. Information Processing Letters 100(2), 60–63 (2006)
Lamport, L.: The Part-Time Parliament. ACM Trans. on Comp. Systems 16(2), 133–169 (1998)
Lamport, L., Shostak, R., Pease, L.: The Byzantine General Problem. ACM Transactions on Programming Languages and Systems 4(3), 382–401 (1982)
Larrea, M., Fernández, A., Arévalo, S.: Optimal Implementation of the Weakest Failure Detector for Solving Consensus.In: Proc. 19th IEEE Int’l Symposium on Reliable Distributed Systems (SRDS 2000), pp. 52–60 (2000)
Malkhi, D., Oprea, F., Zhou, L.: Ω Meets Paxos: Leader Election and Stability without Eventual Timely Links. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 199–213. Springer, Heidelberg (2005)
Mostéfaoui, A., Mourgaya, E., Raynal, M.: Asynchronous Implementation of Failure Detectors.In: Proc. Int’l IEEE Conf. on Dependable Systems and Networks, pp. 351–360 (2003)
Mostéfaoui, A., Raynal, M.: Leader-Based Consensus. Parallel Processing Letters 11(1), 95–107 (2000)
Mostéfaoui, A., Raynal, M., Travers, C.: Crash-resilient Time-free Eventual Leadership.In: Proc. 23th Int’l IEEE Symposium on Reliable Distributed Systems, pp. 208–217 (2004)
Mostéfaoui, A., Raynal, M., Travers, C.: Time-free and timer-based assumptions can be combined to get eventual leadership. IEEE Transactions on Parallel and Distributed Systems 17(7), 656–666 (2006)
Raynal, M.: A short Introduction to Failure Detectors for Asynchronous Distributed Systems. ACM SIGACT News, Distributed Computing Column 36(1), 53–70 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández Anta, A., Raynal, M. (2007). From an Intermittent Rotating Star to a Leader. In: Tovar, E., Tsigas, P., Fouchal, H. (eds) Principles of Distributed Systems. OPODIS 2007. Lecture Notes in Computer Science, vol 4878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77096-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-77096-1_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77095-4
Online ISBN: 978-3-540-77096-1
eBook Packages: Computer ScienceComputer Science (R0)