Algorithms adapting to point contention

DOI10.1145/792538.792541zbMath1325.68032OpenAlexW1983056589MaRDI QIDQ3452498

Hagit Attiya, Arie Fouren

Publication date: 12 November 2015

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

Full work available at URL: https://doi.org/10.1145/792538.792541

zbMATH Keywords

renamingread/write registerswait-free algorithmsasynchronous shared-memory systemscollectcontention-sensitive complexity

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (13)

A visit to mutual exclusion in seven dates ⋮ The space complexity of unbounded timestamps ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Efficient adaptive collect using randomization ⋮ Efficient adaptive collect algorithms ⋮ The RedBlue family of universal constructions ⋮ Linear space bootstrap communication schemes ⋮ Fully-adaptive algorithms for long-lived renaming ⋮ Help when needed, but no more: efficient read/write partial snapshot ⋮ A closer look at fault tolerance ⋮ Unnamed Item ⋮ Wait-freedom with advice ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention

This page was built for publication: Algorithms adapting to point contention