A visit to mutual exclusion in seven dates
From MaRDI portal
Publication:2136281
DOI10.1016/j.tcs.2022.03.030OpenAlexW4223933862MaRDI QIDQ2136281
Michel Raynal, Gadi Taubenfeld
Publication date: 10 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.030
livenesssafetyconcurrencymutual exclusionanonymityasynchronous systemsafe registeratomic registerdeadlock-freedomread-modify-write registerread/write registerstarvation-freedom
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The renaming problem in shared memory systems: an introduction
- On interprocess communication. I: Basic formalism
- Some beautiful arguments using mathematical induction
- Arbitration without common modifiable variables
- Myths about the mutual exclusion problem
- Speeding Lamport's fast mutual exclusion algorithm
- Bounds on shared memory for mutual exclusion
- 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
- The epigenetic consensus problem
- Leader-based de-anonymization of an anonymous read/write memory
- Mutual exclusion in fully anonymous shared memory systems
- Distributed Algorithms for Message-Passing Systems
- A simple local-spin group mutual exclusion algorithm
- Concurrent Programming: Algorithms, Principles, and Foundations
- Algorithms adapting to point contention
- Renaming in an asynchronous environment
- On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion
- Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
- Concurrent reading and writing
- Time, clocks, and the ordering of events in a distributed system
- Time-Adaptive Algorithms for Synchronization
- Unreliable failure detectors for reliable distributed systems
- A new solution of Dijkstra's concurrent programming problem
- Adaptive solutions to the mutual exclusion problem
- Fast timing-based algorithms
- Asynchronous group mutual exclusion
- Shared-memory mutual exclusion: major research trends since 1986
- Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
- Concurrency: the Works of Leslie Lamport
- Recoverable Mutual Exclusion
- Immediate atomic snapshots and fast renaming
- Coordination Without Prior Agreement
- Introduction to Distributed Self-Stabilizing Algorithms
- New combinatorial topology bounds for renaming
- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
- From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
- Distributed Computing
- Proofs from THE BOOK
- The mutual exclusion problem
This page was built for publication: A visit to mutual exclusion in seven dates
