Abstract
This paper investigates the amount of information about failures needed to solve the predicate detection problem in asynchronous systems with crash failures. In particular, we show that predicate detection cannot be solved with traditional failure detectors, which are only functions of failures. In analogy to the definition of failure detectors, we define a failure detection sequencer, which can be regarded as a generalization of a failure detector. More specifically, our failure detection sequencer gs outputs information about failures and about the final state of the crashed process. We show that gs is necessary and sufficient to solve predicate detection. Moreover, gs can be implemented in synchronous systems. Finally, we relate sequencers to perfect failure detectors and characterize the amount of knowledge about failures they additionally offer.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804–823, Oct. 1985.
K. Birman and T. Joseph. Reliable communication in the presence of failures. A CM Transactions on Computer Systems, 5(1):47–76, Feb. 1995.
T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225–267, Mar. 1996.
B. Charron-Bost, C. Delporte-Gallet, and H. Fauconnier. Local and temporal predicates in distributed systems. ACM Transactions on Programming Languages and Systems, 17(1):157–179, Jan. 1995.
B. Charron-Bost, R. Guerraoui, and A. Schiper. Synchronous system and perfect failure detector: Solvability and efficiency issues. In International Conference on Dependable Systems and Networks (IEEE Computer Society), 2000.
C. M. Chase and V. K. Garg. Detection of global predicates: Techniques and their limitations. Distributed Computing, 11(4):191–201, 1998.
R. Cooper and K. Marzullo. Consistent detection of global predicates. ACM SIGPLAN Notices, 26(12):167–174, Dec. 1991.
V. K. Garg and J. R. Mitchell. Distributed predicate detection in a faulty environment. In Proceedings of the 18th IEEE International Conference on Distributed Computing Systems (ICDCS98), 1998.
F. C. Gärtner and S. Kloppenburg. Consistent detection of global predicates under a weak fault assumption. In Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems (SRDS2000), pages 94–103, Nürnberg, Germany, Oct. 2000. IEEE Computer Society Press.
F. C. Gärtner and S. Pleisch. (Im)Possibilities of predicate detection in crash-affected systems. In Proceedings of the 5th Workshop on S elf-Stabilizing Systems (WSS2001), number 2194 in Lecture Notes in Computer Science, pages 98–113, Lisbon, Portugal, Oct. 2001. Springer-Verlag.
F. C. Gärtner and S. Pleisch. Failure detection sequencers: Necessary and sufficient information about failures to solve predicate detection. Research Report RZ 3438, IBM Research Laboratory, Zurich, 2002.
V. Hadzilacos and S. Toueg. A modular approach to fault-tolerant broadcasts and related problems. Technical Report TR94-1425, Cornell University, Computer Science Department, May 1994.
K. Marzullo and G. Neiger. Detection of global state predicates. In Proceedings of the 5th International Workshop on Distributed Algorithms (WDAG91), pages 254–272, 1991.
F. Mattern. Virtual time and global states of distributed systems. In M. C. et al., editor, Proceedings of the International Workshop on Parallel and Distributed Algorithms, pages 215–226, Chateau de Bonas, France, 1989. Elsevier Science Publishers. Reprinted on pages 123–133 in [17].
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, second edition, 2000.
S. Venkatesan. Reliable protocols for distributed termination detection. IEEE Transactions on Reliability, 38(1):103–110, Apr. 1989.
Z. Yang and T. A. Marsland, editors. Global States and Time in Distributed Systems. IEEE Computer Society Press, 1994.
P. yu Li and B. McMillin. Fault-tolerant distributed deadlock detection/resolution. In Proceedings of the 17th Annual International Computer Software and Applications Conference (COMPSAC’93), pages 224–230, Nov. 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gärtner, F.C., Pleisch, S. (2002). Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection. In: Malkhi, D. (eds) Distributed Computing. DISC 2002. Lecture Notes in Computer Science, vol 2508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36108-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-36108-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00073-0
Online ISBN: 978-3-540-36108-4
eBook Packages: Springer Book Archive