On the inherent weakness of conditional primitives

DOI10.1007/s00446-005-0136-5zbMath1266.68116OpenAlexW2105959744MaRDI QIDQ2375295

Faith E. Fich, Nir Shavit, Danny Hendler

Publication date: 13 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-005-0136-5

zbMATH Keywords

conditionalsmutual exclusionspace lower boundsobject implementations

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Tight Bounds for Asynchronous Renaming

Cites Work

• Bounds on shared memory for mutual exclusion
• A time complexity lower bound for randomized implementations of some shared objects
• Contention in shared memory algorithms
• Time and Space Lower Bounds for Nonblocking Implementations
• A fast, scalable mutual exclusion algorithm
• An improved lower bound for the time complexity of mutual exclusion
• Shared-memory mutual exclusion: major research trends since 1986
• Hundreds of impossibility results for distributed computing

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