Constant-RMR implementations of CAS and other synchronization primitives using read and write operations

DOI10.1145/1281100.1281105zbMath1283.68095OpenAlexW2030785908MaRDI QIDQ5401387

Vassos Hadzilacos, Philipp Woelfel, Wojciech Golab, Danny Hendler

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1807/26182

zbMATH Keywords

shared memoryconsensusmutual exclusionremote memory referencescomparison primitives

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (7)

Tight Bounds for Asynchronous Renaming ⋮ RMR-efficient implementations of comparison primitives using read and write operations ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Closing the complexity gap between FCFS mutual exclusion and mutual exclusion ⋮ Randomized mutual exclusion with sub-logarithmic RMR-complexity ⋮ Unnamed Item ⋮ Sub-logarithmic Test-and-Set against a Weak Adversary

This page was built for publication: Constant-RMR implementations of CAS and other synchronization primitives using read and write operations