Abstract
The election of an eventual leader in an asynchronous system prone to process crashes is an important problem of fault-tolerant distributed computing. This problem is known as the implementation of the failure detector Ω. In this work we propose a specification of Ω suited to dynamic systems, i.e., systems in which processes can enter and leave.
Mikel Larrea has been supported by the Spanish Research Council, grant TIN2010-17170, and the Basque Government, grants IT395-10 and S-PE10UN55. Michel Raynal has been supported by the SHAMAN French ANR project.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Chandra, T.D., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM 43(4), 685–722 (1996)
Larrea, M., Raynal, M.: Specifying and Implementing an Eventual Leader Service for Dynamic Systems. Technical Report 1962, IRISA (France) (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larrea, M., Raynal, M. (2011). Brief Announcement: ΔΩ: Specifying an Eventual Leader Service for Dynamic Systems. In: Peleg, D. (eds) Distributed Computing. DISC 2011. Lecture Notes in Computer Science, vol 6950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24100-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-24100-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24099-7
Online ISBN: 978-3-642-24100-0
eBook Packages: Computer ScienceComputer Science (R0)