Abstract
The set agreement problem states that from n proposed values at most n − 1 can be decided. Traditionally, this problem is solved using a failure detector in asynchronous systems where processes may crash but not recover, where processes have different identities, and where all processes initially know the membership. In this paper we study the set agreement problem and the weakest failure detector \(\mathcal{L}\) used to solve it in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities) and without a complete initial knowledge of the membership.
This work has been partially funded by the Spanish Research Council (MICCIN) under project TIN2010-19077, by the Madrid Research Foundation (CAM) under project S2009/TIC-1692 (cofunded by ERDF & ESF).
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aguilera, M.K., Chen, W., Toueg, S.: Failure Detection and Consensus in the Crash-Recovery Model. Distributed Computing 13(2), 99–125 (2000)
Arévalo, S., Fernández Anta, A., Imbs, D., Jiménez, E., Raynal, M.: Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus). In: Proc. IEEE 32nd IEEE Int. Conf. on Distributed Computing Systems (ICDCS), pp. 275–284 (2012)
Arévalo, S., Jiménez, E., Larrea, M., Mengual, L.: Communication-efficient and crash-quiescent Omega with unknown membership. Information Processing Letters 111(4), 194–199 (2011)
Biely, M., Robinson, P., Schmid, U.: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 285–299. Springer, Heidelberg (2009)
Bonnet, F., Raynal, M.: Anonymous Asynchronous Systems: The Case of Failure Detectors. Distributed Computing (in press 2013), doi:10.1007/s00446-012-0169-5
Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 91–100. ACM, New York (1993)
Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM 43(2), 225–267 (1996)
Chandra, T., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM 43(4), 685–722 (1996)
Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105, 132–158 (1993)
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: A Realistic Look At Failure Detectors. In: Proc. 42th International IEEE Conference on Dependable Systems and Networks, DSN 2002, pp. 345–353 (2002)
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Kuznetsov, P., Toueg, S.: The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing. In: Proceedings of 23th ACM Symp. on Principles of Distrib. Comp., PODC, pp. 338–346 (2004)
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.M., Ruppert, E., Tran, H.: The Byzantine agreement with homonymous. In: Proceedings of 30th ACM Symp. on Principles of Distrib. Comp., PODC, pp. 21–30 (2011)
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The Weakest Failure Detector for Message Passing Set-Agreement. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 109–120. Springer, Heidelberg (2008)
Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed systems. Journal of the ACM 34(1), 77–97 (1987)
Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM 46(6), 858–923 (1999)
Hurfin, M., Mostefaoui, A., Raynal, M.: Consensus in asynchronous systems where processes can crash and recover. In: Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, SRDS 1998, pp. 280–286 (1998)
Jiménez, E., Arévalo, S., Fernández, A.: Implementing unreliable failure detectors with unknown membership. Information Processing Letters 100(2), 60–63 (2006)
Martín, C., Larrea, M., Jiménez, E.: Implementing the Omega Failure Detector in the Crash-recovery Failure Model. Journal of Computer and System Sciences 75(3), 178–189 (2009)
Mostéfaoui, A., Raynal, M., Stainer, J.: Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. In: Défago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 341–355. Springer, Heidelberg (2011)
Raynal, M.: Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, 250 pages. Morgan & Claypool Publishers (2010)
Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing 29(5), 1449–1483 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arévalo, S., Jiménez, E., Tang, J. (2013). Set Agreement and the Loneliness Failure Detector in Crash-Recovery Systems. In: Gramoli, V., Guerraoui, R. (eds) Networked Systems. NETYS 2013. Lecture Notes in Computer Science, vol 7853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40148-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-40148-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40147-3
Online ISBN: 978-3-642-40148-0
eBook Packages: Computer ScienceComputer Science (R0)