Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion

DOI10.1145/3293611.3331594MaRDI QIDQ5145196OpenAlexFDO

Authors Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel

Publication date 20 January 2021

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

Full work available at URL https://arxiv.org/abs/1810.03723

zbMATH Keywords

asynchronous systemmutual exclusioncomputabilityatomic registerdeadlock-freedomread-modify-write registerread-write registeranonymous shared memory

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Mutual exclusion in fully anonymous shared memory systems
• Bounds on shared memory for mutual exclusion
• Resilience of mutual exclusion algorithms to transient memory faults
• Anonymous Read/write memory: leader election and de-anonymization
• scientific article; zbMATH DE number 2089981

Cited in

(7)

• Corrigendum to: ``Mutual exclusion in fully anonymous shared memory systems
• Election in fully anonymous shared memory systems: tight space bounds and algorithms
• A Deadlock-Free Semantics for Shared Memory Concurrency
• A visit to mutual exclusion in seven dates
• Mutual exclusion in fully anonymous shared memory systems
• Leader-based de-anonymization of an anonymous read/write memory
• scientific article; zbMATH DE number 7515766 (Why is no real title available?)

This page was built for publication: Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145196)