Two Consensus Algorithms with Atomic Registers and Failure Detector Ω

Authors:
Carole Delporte-Gallet;Hugues Fauconnier
Affiliations:
Laboratoire d'Informatique Algorithmique: Fondements et Applications, Université Paris VII - Denis Diderot,;Laboratoire d'Informatique Algorithmique: Fondements et Applications, Université Paris VII - Denis Diderot,
Venue:
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Year:
2009

Citing 20
Cited 5

On processor coordination using asynchronous hardware

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On achieving consensus using a shared memory

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast randomized consensus using shared memory

Journal of Algorithms
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
From binary consensus to multivalued consensus in asynchronous message-passing systems

Information Processing Letters
Distributed Algorithms

Distributed Algorithms
Deconstructing paxos

ACM SIGACT News
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Disk Paxos

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Obstruction-Free Synchronization: Double-Ended Queues as an Example

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
On implementing omega with weak reliability and synchrony assumptions

Proceedings of the twenty-second annual symposium on Principles of distributed computing
The weakest failure detectors to solve certain fundamental problems in distributed computing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Active disk Paxos with infinitely many processes

Distributed Computing - Special issue: PODC 02
The Alpha of Indulgent Consensus

The Computer Journal
Ω meets paxos: leader election and stability without eventual timely links

DISC'05 Proceedings of the 19th international conference on Distributed Computing

Joining a Distributed Shared Memory Computation in a Dynamic Distributed System

SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Value-based sequential consistency for set objects in dynamic distributed systems

EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
k-bounded set objects in eventually synchronous distributed systems with churn and continuous accesses

EWDC '11 Proceedings of the 13th European Workshop on Dependable Computing
Anonymous agreement: the janus algorithm

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
From a store-collect object and Ω to efficient asynchronous consensus

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present here two consensus algorithms in shared memory asynchronous systems with the eventual leader election failure detector *** . In both algorithms eventually only the leader given by failure detector *** will progress, and being eventually alone to make steps the leader will decide. The first algorithm uses an infinite number of multi-writer multi-reader atomic registers and works with an unbounded number of anonymous processes. The second uses only a finite number of single-writer multi-reader registers but assumes a finite number of processes with known unique identities.