Mutual exclusion in fully anonymous shared memory systems
From MaRDI portal
Publication:2308458
DOI10.1016/j.ipl.2020.105938zbMath1433.68060OpenAlexW3008803196MaRDI QIDQ2308458
Gadi Taubenfeld, Michel Raynal
Publication date: 3 April 2020
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-03148640
Related Items (4)
A visit to mutual exclusion in seven dates ⋮ Leader-based de-anonymization of an anonymous read/write memory ⋮ Corrigendum to: ``Mutual exclusion in fully anonymous shared memory systems ⋮ Election in fully anonymous shared memory systems: tight space bounds and algorithms
Cites Work
- Anonymous asynchronous systems: the case of failure detectors
- On interprocess communication. I: Basic formalism
- Myths about the mutual exclusion problem
- The choice coordination problem
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
- Computing in totally anonymous asynchronous shared memory systems
- Anonymous and fault-tolerant shared-memory computing
- Anonymous Read/write memory: leader election and de-anonymization
- Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
- Concurrent Programming: Algorithms, Principles, and Foundations
- On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion
- Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
- Coordination Without Prior Agreement
This page was built for publication: Mutual exclusion in fully anonymous shared memory systems
