Bounded-wait combining: constructing robust and high-throughput shared objects
From MaRDI portal
Publication:2377268
DOI10.1007/S00446-009-0078-4zbMath1267.68309OpenAlexW2010487654MaRDI QIDQ2377268
Publication date: 28 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.8263
Related Items (2)
Bounded-wait combining: constructing robust and high-throughput shared objects ⋮ A scalable lock-free stack algorithm
Uses Software
Cites Work
- A scalable lock-free stack algorithm
- Combining funnels: A dynamic approach to software combining
- The counting pyramid: an adaptive distributed counting scheme
- Bounded-wait combining: constructing robust and high-throughput shared objects
- Improved implementations of binary universal operations
- Efficient synchronization of multiprocessors with shared memory
- Contention in shared memory algorithms
- Counting networks
- Two-handed emulation
- Randomized wait-free concurrent objects (extended abstract)
- Distributed Computing
- SNZI
- Principles of Distributed Systems
This page was built for publication: Bounded-wait combining: constructing robust and high-throughput shared objects