Skip to main content

Using Time Instead of Timeout for Fault-Tolerant Distributed Systems

PDF DOI 10.1145/2993.2994 dblp BibTeX

Abstract

A general method is described for implementing a distributed system with any desired degree of faulttolerance.Instead of relying upon explicit timeouts, processes execute a simple clock-driven algorithm.Reliable clock synchronization and a solution to the Byzantine Generals Problem are assumed.

Related papers

Efficient Fault-Tolerant Algorithms for Distributed Resource Allocation TOPLAS 1995
Experience with a Fault-Tolerant Garbage Collector in a Distributed List System ISMM 1992
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms POPL 2017
PSync: a partially synchronous language for fault-tolerant distributed algorithms POPL 2016
On Verifying Fault Tolerance of Distributed Protocols TACAS 2008
Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms VMCAI 2017
A fault-tolerant programming model for distributed interactive applications OOPSLA 2019
Fault tolerant functional reactive programming (functional pearl) ICFP 2018