6 search results - page 1 / 2 » On the Use of Registers in Achieving Wait-Free Consensus |
70
Voted
PODC
1994
ACM
15 years 1 months ago
1994
ACM
WDAG
1995
Springer
15 years 1 months ago
1995
Springer
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
83
Voted
PODC
2012
ACM
13 years 1 days ago
2012
ACM
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
99
Voted
CAV
2001
Springer
15 years 1 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...