Sciweavers

34 search results - page 3 / 7
» Consensus in Anonymous Distributed Systems: Is There a Weake...
Sort
View
OPODIS
1997
13 years 7 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...
PODC
2012
ACM
11 years 8 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
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...
PODC
2006
ACM
14 years 7 days ago
Timeliness, failure-detectors, and consensus performance
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Idit Keidar, Alexander Shraer
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 6 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