Abstract
Most fault-tolerant algorithms are designed assuming that out of n components, no more than t can be faulty. For example, solutions to the Consensus problem are usually developed assuming no more than t of the n processes are faulty, where “being faulty” is specialized by a failure model. We call this the t of n assumption (also known as threshold model). It is a convenient assumption to make. For example, bounds are easily expressed as a function of t: if processes can fail only by crashing, then the Consensus problem is solvable when t < n if the system is synchronous and when t < 2n if the system is asynchronous extended with a failure detector of the class ◊W. [5.5], [5.1]
This work was developed in the context of the RAMP project, supported by DARPA as project number N66001-01-1-8933.
The author is partially supported by a scholarship from CAPES.
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
T. Chandra, V. Hadzilacos, and S. Toueg. TheWeakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4):685–722, July 1996.
A. Doudou and A. Schiper. Muteness Detectors for Consensus with Byzantine Processes. In Proceedings of the 17th ACM Symposium on Principle of Distributed Computing, page 315, Puerto Vallarta, Mexico, July 1998.
M. Hirt and U. Maurer. Complete Characterization of Adversaries Tolerable in Secure Multy-Party Computation. In ACM Symposium on Principles of Distributed Computing, pages 25–34, Santa Barbara, California, 1997.
F. Junqueira and K. Marzullo. Consensus for Dependent Process Failures. Technical report, UCSD, La Jolla, CA, September 2002. http://www.cs.ucsd.edu/users/.avio/Docs/Gen.ps.
I. Keidar and S. Rajsbaum. On the Cost of Fault-Tolerant Consensus When There Are No Faults-A Tutorial. Technical Report MIT-LCS-TR-821, MIT, May 2001.
D. Malkhi and M. Reiter. Byzantine Quorum Systems. In 29th ACM Symposium on Theory of Computing, pages 569–578, May 1997.
Y. Ren and J. B. Dugan. Optimal Design of Reliable Systems Using Static and Dynamic Fault Trees. IEEE Transactions on Reliability, 47(3):234–244, December 1998.
P. Thambidurai and Y.-K. Park. Interactive Consistency with Multiple Failure Modes. In IEEE 7th Symposium on Reliable Distributed Systems, pages 93–100, Columbus, Ohio, October 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Junqueira, F., Marzullo, K. (2003). Designing Algorithms for Dependent Process Failures. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds) Future Directions in Distributed Computing. Lecture Notes in Computer Science, vol 2584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37795-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-37795-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00912-2
Online ISBN: 978-3-540-37795-5
eBook Packages: Springer Book Archive