On the inherent weakness of conditional synchronization primitives

DOI10.1145/1011767.1011780MaRDI QIDQ5501485zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Danny Hendler, Nir Shavit, 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

compare-and-swapload-linkedlower boundsstore-conditionalsynchronization primitivestest-and-setwait-freedom

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7730616
• On deciding synchronizability for asynchronously communicating systems
• Another approach to the implementation of synchronization primitives
• Condition-based consensus in synchronous systems
• On implementing omega with weak reliability and synchrony assumptions
• Using conditions to expedite consensus in synchronous distributed systems
• Grounding synchronous deterministic concurrency in sequential programming
• Synchronizability for Verification of Asynchronously Communicating Systems
• Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors

Cited in

(14)

• The power of multiobjects.
• RMR-efficient implementations of comparison primitives using read and write operations
• On the inherent weakness of conditional primitives
• Solo-valency and the cost of coordination
• On implementing omega with weak reliability and synchrony assumptions
• On the space complexity of randomized synchronization
• scientific article; zbMATH DE number 1559573 (Why is no real title available?)
• Highly-efficient wait-free synchronization
• Arbitration-free synchronization
• A complexity-based hierarchy for multiprocessor synchronization (extended abstract)
• Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
• Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated
• Nonblocking Concurrent Data Structures with Condition Synchronization
• Lower bounds on the amortized time complexity of shared objects

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501485)