On the inherent weakness of conditional synchronization primitives

DOI10.1145/1011767.1011780zbMath1321.68077OpenAlexW2050389497WikidataQ55933991 ScholiaQ55933991MaRDI QIDQ5501485

Nir Shavit, Danny Hendler, Faith E. Fich

Publication date: 3 August 2015

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

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

zbMATH Keywords

lower boundswait-freedomcompare-and-swaptest-and-setsynchronization primitivesload-linkedstore-conditional

Mathematics Subject Classification ID

Searching and sorting (68P10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (1)

Solo-valency and the cost of coordination

This page was built for publication: On the inherent weakness of conditional synchronization primitives