Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
From MaRDI portal
Publication:1953239
DOI10.1007/s00446-004-0113-4zbMath1264.68213OpenAlexW2073470450MaRDI QIDQ1953239
Yonatan Aumann, Michael A. Bender
Publication date: 7 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-004-0113-4
Related Items (3)
Switched PIOA: parallel composition via distributed scheduling ⋮ A modular approach to shared-memory consensus, with applications to the probabilistic-write model ⋮ Tight bounds for adopt-commit objects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clock construction in fully asynchronous parallel systems and PRAM simulation
- Efficient execution of nondeterministic parallel programs on asynchronous systems
- Polylog randomized wait-free consensus
- Lower bounds for distributed coin-flipping and randomized consensus
- Flipping Persuasively in Constant Time
- Fast randomized consensus using shared memory
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Contention in shared memory algorithms
- Are wait-free algorithms fast?
- Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
- Randomized wait-free concurrent objects (extended abstract)
- Efficient asynchronous consensus with the weak adversary scheduler
This page was built for publication: Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler