Abstract
In 1985, Fischer, Lynch and Paterson published their celebrated impossibility of solving distributed agreement (consensus) in purely asynchronous distributed systems with crash failures. Synchrony requirements, i.e., constraints on the occurrence of certain events in a distributed system, are hence mandatory for being able to solve interesting distributed computing problems. Timing requirements are the most obvious, though not the only, possibility to express synchrony conditions. We will survey existing partially synchronous distributed computing models and their ability to circumvent impossibility results, and explore the role of time and clocks in designing fault-tolerant distributed algorithms in such models.
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmid, U. (2010). Synchrony and Time in Fault-Tolerant Distributed Algorithms. In: Chatterjee, K., Henzinger, T.A. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2010. Lecture Notes in Computer Science, vol 6246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15297-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-15297-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15296-2
Online ISBN: 978-3-642-15297-9
eBook Packages: Computer ScienceComputer Science (R0)