Recoverable Mutual Exclusion in Sub-logarithmic Time

DOI10.1145/3087801.3087819zbMath1380.68051OpenAlexW2738823197MaRDI QIDQ5368966

Danny Hendler, Wojciech Golab

Publication date: 11 October 2017

Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

fault toleranceconcurrencyshared memorymutual exclusionrecoverymulti-core algorithmsnon-volatile main memorypersistent data structures.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (4)

Unnamed Item ⋮ Recoverable mutual exclusion with abortability ⋮ Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion ⋮ Recoverable mutual exclusion

This page was built for publication: Recoverable Mutual Exclusion in Sub-logarithmic Time