Randomized consensus in expected O(n2log n) operations

Randomized consensus in expected O(n2log n) operations

We consider asynchronous shared memory distributed systems, and investigate coordination problems in this model. We provide a waitfree randomized consensus protocol that requires an expected O(n2 log n) atomic operations.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bracha, Gabi, Rachman, Ophir
Format: Buchkapitel
Sprache:eng
Schlagworte:
Atomic Operation
Consensus Problem
Constant Probability
Coordination Problem
Shared Memory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider asynchronous shared memory distributed systems, and investigate coordination problems in this model. We provide a waitfree randomized consensus protocol that requires an expected O(n2 log n) atomic operations.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0022443