Read-modify-write networks
From MaRDI portal
Publication:5138502
DOI10.1007/s00446-003-0097-5zbMath1448.68224OpenAlexW2063616137MaRDI QIDQ5138502
Panagiota Fatourou, Maurice P. Herlihy
Publication date: 4 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-003-0097-5
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient counting network
- An inherent bottleneck in distributed counting
- Timing conditions for linearizability in uniform counting networks
- Elimination trees and the construction of pools and stacks
- Combining funnels: A dynamic approach to software combining
- Sorting and counting networks of arbitrary width and small depth
- Efficient synchronization of multiprocessors with shared memory
- Contention in shared memory algorithms
- Counting networks
- A Lower Bound on Wait-Free Counting
- A combinatorial treatment of balancing networks
- Linearizable counting networks
- Sequentially consistent versus linearizable counting networks
This page was built for publication: Read-modify-write networks