Contention in shared memory algorithms

DOI10.1145/268999.269000zbMath0904.68114OpenAlexW1984407065MaRDI QIDQ4208874

Cynthia Dwork, Orli Waarts, Maurice P. Herlihy

Publication date: 4 November 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/

zbMATH Keywords

counting networksshared-memory algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Related Items (18)

On the inherent weakness of conditional primitives ⋮ Solo-valency and the cost of coordination ⋮ Bounded-wait combining: constructing robust and high-throughput shared objects ⋮ RMR-efficient implementations of comparison primitives using read and write operations ⋮ Low-contention data structures ⋮ Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler ⋮ Tight bounds for shared memory systems accessed by Byzantine processes ⋮ Waiting in concurrent algorithms ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Hundreds of impossibility results for distributed computing ⋮ Read-modify-write networks ⋮ The impact of randomization in smoothing networks ⋮ The cost of concurrent, low-contention Read \& Modify \& Write ⋮ An efficient counting network ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lower Bounds for Restricted-Use Objects ⋮ The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms

This page was built for publication: Contention in shared memory algorithms