Sciweavers

870 search results - page 12 / 174
» The failure detector abstraction
Sort
View
PDCAT
2009
Springer
14 years 3 months ago
Modular Consensus Algorithms for the Crash-Recovery Model
—In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined l...
Felix C. Freiling, Christian Lambertz, Mila E. Maj...
JACM
2010
104views more  JACM 2010»
13 years 7 months ago
Tight failure detection bounds on atomic object implementations
This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
WDAG
1998
Springer
107views Algorithms» more  WDAG 1998»
14 years 1 months ago
Transient Fault Detectors
We present fault detectors for transient faults, (i.e. corruptions of the memory of the processors, but not of the code of the processors). We distinguish fault detectors for tasks...
Joffroy Beauquier, Sylvie Delaët, Shlomi Dole...
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 8 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
IEEEARES
2009
IEEE
14 years 3 months ago
Perfect Failure Detection in the Partitioned Synchronous Distributed System Model
—In this paper we show that it is possible to implement a perfect failure detector P (one that detects all faulty processes if and only if those processes failed) in a non-synchr...
Raimundo José de Araújo Macêdo...