Sciweavers

231 search results - page 7 / 47
» Asynchronous failure detectors
Sort
View
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, ...
OPODIS
1997
13 years 8 months ago
Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector
Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous d...
Kim Potter Kihlstrom, Louise E. Moser, P. M. Melli...
SAC
2010
ACM
14 years 2 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
IEEEARES
2008
IEEE
14 years 1 months ago
A Lazy Monitoring Approach for Heartbeat-Style Failure Detectors
—Failure detectors are a fundamental part of safe fault-tolerant distributed systems. Many failure detectors use heartbeats to draw conclusions about the state of nodes within a ...
Benjamin Satzger, Andreas Pietzowski, Wolfgang Tru...
PDCAT
2009
Springer
14 years 2 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...