[PDF][PDF] A modular approach to fault-tolerant broadcasts and related problems
V Hadzilacos, S Toueg - 1994 - ecommons.cornell.edu
The design and verification of fault-tolerant distributed applications is widely viewed as a
complex endeavor. To a large extent this is due to the fact that the communication primitives …
complex endeavor. To a large extent this is due to the fact that the communication primitives …
Heartbeat: A timeout-free failure detector for quiescent reliable communication
We study the problem of achieving reliable communication with quiescent algorithms (ie,
algorithms that eventually stop sending messages) in asynchronous systems with process …
algorithms that eventually stop sending messages) in asynchronous systems with process …
Indulgent algorithms (preliminary version)
R Guerraoui - Proceedings of the nineteenth annual ACM symposium …, 2000 - dl.acm.org
Informally, an indulgent algorithm is a distributed algorithm that tolerates unreliable failure
detection: the algorithm is indulgent towards its failure detector. This paper formally …
detection: the algorithm is indulgent towards its failure detector. This paper formally …
Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks
We consider partitionable networks with process crashes and lossy links, and focus on the
problems of reliable communication and consensus for such networks. For both problems …
problems of reliable communication and consensus for such networks. For both problems …
Revisiting the Paxos algorithm
This paper develops a new I/O automaton model called the Clock General Timed Automaton
(Clock GTA) model. The Clock GTA is based on the General Timed Automaton (GTA) of …
(Clock GTA) model. The Clock GTA is based on the General Timed Automaton (GTA) of …
Simulating reliable links with unreliable links in the presence of process crashes
A Basu, B Charron-Bost, S Toueg - … , WDAG'96 Bologna, Italy, October 9 …, 1996 - Springer
Simulating reliable links with unreliable links in the presence of process crashes Page 1
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes* Anindya …
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes* Anindya …
On quiescent reliable communication
We study the problem of achieving reliable communication with quiescent algorithms (ie,
algorithms that eventually stop sending messages) in asynchronous systems with process …
algorithms that eventually stop sending messages) in asynchronous systems with process …
Byzantine-resistant total ordering algorithms
LE Moser, PM Melliar-Smith - Information and Computation, 1999 - Elsevier
Multicast group communication protocols are used extensively in fault-tolerant distributed
systems. For many such protocols, the acknowledgments for individual messages define a …
systems. For many such protocols, the acknowledgments for individual messages define a …
[PDF][PDF] Structured derivations of consensus algorithms for failure detectors
J Yang, G Neiger, E Gafni - Proceedings of the seventeenth annual ACM …, 1998 - dl.acm.org
In a seminal paper, Chandra and Toueg showed how unreliable failure detectors could
allows processors to achieve consensus in asynchronous message passing systems. Since …
allows processors to achieve consensus in asynchronous message passing systems. Since …
Revisiting the weakest failure detector for uniform reliable broadcast
M Kawazoe Aguilera, S Toueg, B Deianov - International Symposium on …, 1999 - Springer
Abstract Uniform Reliable Broadcast (URB) is a communication prim-itive that requires that if
a process delivers a message, then all correct processes also deliver this message. A recent …
a process delivers a message, then all correct processes also deliver this message. A recent …