Sciweavers

44 search results - page 3 / 9
» Anonymous Asynchronous Systems: The Case of Failure Detector...
Sort
View
TC
2002
13 years 5 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
PRDC
2006
IEEE
13 years 11 months ago
Minimal System Conditions to Implement Unreliable Failure Detectors
In this paper we explore the minimal system requirements to implement unreliable failure detectors. We first consider systems formed by lossy asynchronous and eventually timely l...
Antonio Fernández, Ernesto Jiménez, ...
PODC
2009
ACM
13 years 10 months ago
The weakest failure detector for solving k-set agreement
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact a...
Eli Gafni, Petr Kuznetsov
DSN
2006
IEEE
13 years 12 months ago
One-step Consensus with Zero-Degradation
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...
Dan Dobre, Neeraj Suri
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 5 months ago
On Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg