The cost of concurrent, low-contention Read \& Modify \& Write

DOI10.1016/J.TCS.2004.04.018zbMath1070.68013OpenAlexW2097181394MaRDI 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

zbMATH Keywords

SynchronizationDistributed computingLower boundsLinearizabilityMonotone Linearizability LemmaSwitching networks

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Concurrent counting is harder than queuing ⋮ An efficient counting network ⋮ Sequentially consistent versus linearizable counting networks

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

This page was built for publication: The cost of concurrent, low-contention Read \& Modify \& Write