The cost of concurrent, low-contention Read \& Modify \& Write
From MaRDI portal
Publication:1770373
DOI10.1016/j.tcs.2004.04.018zbMath1070.68013MaRDI QIDQ1770373
Marios Mavronicolas, Costas Busch, Paul G. Spirakis
Publication date: 6 April 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.04.018
Synchronization; Distributed computing; Lower bounds; Linearizability; Monotone Linearizability Lemma; Switching networks
68M14: Distributed systems
Related Items
Sequentially consistent versus linearizable counting networks, Concurrent counting is harder than queuing, An efficient counting network
Cites Work
- Unnamed Item
- Unnamed Item
- Bounds on shared memory for mutual exclusion
- Efficient synchronization of multiprocessors with shared memory
- The notions of consistency and predicate locks in a database system
- Contention in shared memory algorithms
- Counting networks
- Linearizable counting networks
- Read-modify-write networks