Sciweavers

35 search results - page 2 / 7
» Eventually Consistent Failure Detectors
Sort
View
AINA
2010
IEEE
14 years 1 months ago
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
François Bonnet, Michel Raynal
SRDS
1996
IEEE
14 years 22 days ago
Fail-Aware Failure Detectors
In existing asynchronous distributed systems it is impossible to implement failure detectors which are perfect, i.e. they only suspect crashed processes and eventually suspect all...
Christof Fetzer, Flaviu Cristian
NCA
2008
IEEE
14 years 3 months ago
Failure, Disconnection and Partition Detection in Mobile Environment
In mobile environment, nodes can move around and voluntarily leave or join the network. Furthermore, they can crash or be disconnected from the network due to the absence of netwo...
Denis Conan, Pierre Sens, Luciana Arantes, Mathieu...
PODC
2006
ACM
14 years 2 months 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
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
13 years 7 months ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
François Bonnet, Michel Raynal