A complexity-based classification for multiprocessor synchronization

DOI10.1007/s00446-019-00361-3zbMath1434.68048OpenAlexW2971627429WikidataQ127283430 ScholiaQ127283430MaRDI QIDQ1988522

Leqi Zhu, Faith Ellen, Rati Gelashvili, Nir Shavit

Publication date: 23 April 2020

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

Full work available at URL: https://hdl.handle.net/1721.1/131444

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cites Work

• Tight bounds for adopt-commit objects
• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
• Anonymous and fault-tolerant shared-memory computing
• On the space complexity of randomized synchronization
• Fast randomized consensus using shared memory
• Atomic snapshots of shared memory
• Robust wait-free hierarchies
• Time and Space Lower Bounds for Nonblocking Implementations
• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• Determining Consensus Numbers
• Revisionist Simulations
• A tight space bound for consensus
• A Complexity-Based Hierarchy for Multiprocessor Synchronization
• Distributed Computing
• Distributed Computing
• Polylogarithmic concurrent data structures from monotone circuits
• On the optimal space complexity of consensus for anonymous processes

This page was built for publication: A complexity-based classification for multiprocessor synchronization