Skip to main content

Fault tolerance via idempotence

Ganesan Ramalingam, Kapil Vaswani

DOI 10.1145/2429069.2429100 dblp BibTeX

Abstract

Building distributed services and applications is challenging due to the pitfalls of distribution such as process and communication failures. A natural solution to these problems is to detect potential failures, and retry the failed computation and/or resend messages. Ensuring correctness in such an environment requires distributed services and applications to be idempotent.

Related papers

Static analysis and compiler design for idempotent processing PLDI 2012
Fault-Tolerant Resource Reasoning APLAS 2015
Faulty Logic: Reasoning about Fault Tolerant Programs ESOP 2010
A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract) ESOP 2007
On Verifying Fault Tolerance of Distributed Protocols TACAS 2008
Experience with a Fault-Tolerant Garbage Collector in a Distributed List System ISMM 1992
Supporting fault-tolerance in streaming grid applications PPoPP 2007
Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms VMCAI 2017