The cost of concurrent, low-contention Read \& Modify \& Write
type: Item
instance of: scholarly article
title: The cost of concurrent, low-contention Read \& Modify \& Write
zbMATH Open document ID: 1070.68013
author: Costas Busch
author: Marios Mavronicolas
author: P. G. Spirakis
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 2153172
zbMATH Keywords: Distributed computing
zbMATH Keywords: Synchronization
zbMATH Keywords: Linearizability
zbMATH Keywords: Monotone Linearizability Lemma
zbMATH Keywords: Switching networks
zbMATH Keywords: Lower bounds
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.04.018
OpenAlex ID: W2097181394
cites work: Supporting increment and decrement operations in balancing networks
cites work: Counting networks
cites work: Bounds on shared memory for mutual exclusion
cites work: Contention in shared memory algorithms
cites work: The notions of consistency and predicate locks in a database system
cites work: Q4436061
cites work: Read-modify-write networks
cites work: Linearizable counting networks
cites work: Efficient synchronization of multiprocessors with shared memory
DOI: 10.1016/J.TCS.2004.04.018
description: scientific article; zbMATH DE number 2153172