Sciweavers

4 search results - page 1 / 1
» The Anonymous Consensus Hierarchy and Naming Problems
Sort
View
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
13 years 3 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
AINA
2010
IEEE
13 years 10 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
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 5 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah