Abstract
The knowledge about failures needed to solve distributed agreement problems can be expressed in terms of completeness and accuracy properties of failure detectors introduced by Chandra and Toueg. The accuracy properties they have considered restrict the false suspicions that can be made by all the processes in the system. In this paper, we define “Γ-accurate” failure detectors, whose accuracy properties (only) restrict the false suspicions that can be made by a subset Γ of the processes. We discuss the relations between the classes of Γ-accurate failure detectors, and the classes of failure detectors defined by Chandra and Toueg. Then we point out the impact of these relations on the solvability of agreement problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Basu, B. Charron-Bost and S. Toueg. Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes. Proceedings of the 10th International Workshop on Distributed Algorithms, LNCS, Springer Verlag, October 1996.
O. Babaoglu, R. Davoli and A. Montresor. Failure Detectors, GroupMembership and View-Synchronous Communication in Partitionable Systems. Technical Report, University of Bologna, Computer Science Department. November 1995.
T. Chandra, V. Hadzilacos and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4), July 1996. A preliminary version appeared in Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, pp 147–159. ACM Press. August 1992.
T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 34(1), pp 225–267, March 1996. A preliminary version appeared in Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, pp 325–340. ACM Press. August 1991.
R. Friedman, I. Keidar, D. Malki, K. Birman and D. Dolev. Deciding in Partitionable Networks, Technical Report, Cornell University, Computer Science Department. November 1995.
R. Guerraoui. Revisiting the relationship between Non Blocking Atomic Commitment and Consensus problems. Proceedings of the 9th International Workshop on Distributed Algorithms, pages 87–100, LNCS 972, Springer Verlag, September 1995.
R. Guerraoui and A. Schiper. Atomic Multicast harder than Atomic Broadcast. Technical Report, Ecole Polytechnique Fédérale de Lausanne, Computer Science Department. May 1996.
R. Guerraoui and A. Schiper. “Γ-Accurate” Failure Detectors. Technical Report, Ecole Polytechnique Fédérale de Lausanne, Computer Science Department. May 1996.
I. Keidar and D. Dolev. Increasing the Resilience of Atomic Commit, at No Additional Cost. Proceedings of the ACM Symposium on Principles of Database Systems, pages 245–254. ACM Press, May 1994.
L. Sabel and K. Marzullo. Election Vs. Consensus in Asynchronous Systems. Technical Report TR95-1488, Cornell Univ, 1995.
D. Skeen. NonBlocking Commit Protocols. Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 133–142. ACM Press, 1981.
D. Skeen. A Quorum-Based Commit Protocol. Proceedings of the Berkeley Workshop on Distributed Data Management and Computer Networks, pages 69–80, Num 6, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guerraoui, R., Schiper, A. (1996). “Γ-accurate” failure detectors. In: Babaoğlu, Ö., Marzullo, K. (eds) Distributed Algorithms. WDAG 1996. Lecture Notes in Computer Science, vol 1151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61769-8_18
Download citation
DOI: https://doi.org/10.1007/3-540-61769-8_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61769-3
Online ISBN: 978-3-540-70679-3
eBook Packages: Springer Book Archive