Sciweavers

42 search results - page 4 / 9
» The Weakest Failure Detector for Solving Consensus
Sort
View
PODC
2012
ACM
11 years 10 months ago
Asynchronous failure detectors
Failure detectors — oracles that provide information about process crashes — are an important ion for crash tolerance in distributed systems. Although current failure-detector...
Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry
DC
1999
13 years 7 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal
OPODIS
2008
13 years 9 months ago
With Finite Memory Consensus Is Easier Than Reliable Broadcast
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus ...
Carole Delporte-Gallet, Stéphane Devismes, ...
IPPS
2000
IEEE
13 years 12 months ago
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
Achour Mostéfaoui, Michel Raynal
EDCC
2010
Springer
14 years 7 days ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal