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
Notes
- 1.
Intuitively, “known bound” means that the bound can be “built into” the algorithm. A formal definition is given in the next section.
Recommended Reading
Bar-Noy A, Dolev D, Dwork C, Strong HR (1987) Shifting gears: changing algorithms on the fly To expedite Byzantine agreement. In: PODC, pp 42–51
Chandra TD, Hadzilacos V, Toueg S (1996) The weakest failure detector for solving consensus. J ACM 43(4):685–722
Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225–267
Charron-Bost B, Schiper A (2007) The “Heard-Of” model: computing in distributed systems with benign failures. Technical report, EPFL
Dolev D, Dwork C, Stockmeyer L (1987) On the minimal synchrony needed for distributed consensus. J ACM 34(1):77–97
Dolev D, Strong HR (1983) Authenticated algorithms for Byzantine agreement. SIAM J Comput 12(4):656–666
Dwork C, Lynch N, Stockmeyer L (1988) Consensus in the presence of partial synchrony. J ACM 35(2):288–323
Fischer M, Lynch N, Paterson M (1985) Impossibility of distributed consensus with one faulty process. J ACM 32:374–382
Gray J (1990) A comparison of the Byzantine agreement problem and the transaction commit problem. In: Fault-tolerant distributed computing [AsilomarWorkshop 1986], vol 448, LNCS. Springer, Berlin, pp 10–17
Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Commun ACM 21(7):558–565
Lamport L (1998) The part-time parliament. ACM Trans Comput Syst 16(2):133–169
Pease MC, Shostak RE, Lamport L (1980) Reaching agreement in the presence of faults. J ACM 27(2):228–234
Rabin M (1983) Randomized Byzantine generals. In: Proceedings of the 24th annual ACM symposium on foundations of computer science, pp 403–409
Schneider FB (1993) Replication management using the state-machine approach. In: Mullender S (ed) Distributed systems. ACM, pp 169–197
Srikanth TK, Toueg S (1987) Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib Comput 2(2):80–94
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Charron-Bost, B., Schiper, A. (2016). Consensus with Partial Synchrony. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_91
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_91
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering