A Complexity-Based Hierarchy for Multiprocessor Synchronization
From MaRDI portal
Publication:5361947
DOI10.1145/2933057.2933113zbMath1375.68198arXiv1607.06139OpenAlexW2506042853MaRDI QIDQ5361947
Faith Ellen, Leqi Zhu, Nir Shavit, Rati Gelashvili
Publication date: 29 September 2017
Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.06139
Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (3)
Extending the wait-free hierarchy to multi-threaded systems ⋮ A complexity-based classification for multiprocessor synchronization ⋮ A Tight Space Bound for Consensus
This page was built for publication: A Complexity-Based Hierarchy for Multiprocessor Synchronization