Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model

DOI10.1145/3087801.3087837zbMath1380.68426OpenAlexW2736699952MaRDI QIDQ5368967

George Giakkoupis, Philipp Woelfel

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://hal.inria.fr/hal-01635734/file/podc2017mutex.pdf

zbMATH Keywords

shared memorymutual exclusionRMR complexityoblivious adversaryCC model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (4)

Recoverable mutual exclusion with abortability ⋮ Recoverable mutual exclusion ⋮ Unnamed Item ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms

This page was built for publication: Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model