A visit to mutual exclusion in seven dates

DOI10.1016/J.TCS.2022.03.030MaRDI QIDQ2136281zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

concurrencyasynchronous systemmutual exclusionanonymitysafetylivenessatomic registersafe registerdeadlock-freedomread-modify-write registerread/write registerstarvation-freedom

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Shared-memory mutual exclusion: major research trends since 1986
• A fast, scalable mutual exclusion algorithm
• The mutual exclusion problem. I: A theory of interprocess communication
• The mutual exclusion problem
• On the family of critical section problems

Cites work

• scientific article; zbMATH DE number 1696664 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 4082934 (Why is no real title available?)
• scientific article; zbMATH DE number 1878545 (Why is no real title available?)
• scientific article; zbMATH DE number 7515766 (Why is no real title available?)
• A new solution of Dijkstra's concurrent programming problem
• A simple local-spin group mutual exclusion algorithm
• Adaptive solutions to the mutual exclusion problem
• Algorithms adapting to point contention
• Anonymous and fault-tolerant shared-memory computing
• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
• Arbitration without common modifiable variables
• Asynchronous group mutual exclusion
• Bounds on shared memory for mutual exclusion
• Computing in totally anonymous asynchronous shared memory systems
• Concurrency. The works of Leslie Lamport
• Concurrent programming: algorithms, principles, and foundations.
• Concurrent reading and writing
• Coordination without prior agreement
• Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
• Distributed Algorithms for Message-Passing Systems
• Distributed Computing
• Fast timing-based algorithms
• From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
• Immediate atomic snapshots and fast renaming
• Introduction to Distributed Self-Stabilizing Algorithms
• Leader-based de-anonymization of an anonymous read/write memory
• Mutual exclusion algorithms with constant RMR complexity and wait-free exit code
• Mutual exclusion in fully anonymous shared memory systems
• Myths about the mutual exclusion problem
• New combinatorial topology bounds for renaming: the upper bound
• On interprocess communication. I: Basic formalism
• On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion
• Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
• Proofs from THE BOOK
• Recoverable mutual exclusion (extended abstract)
• Renaming in an asynchronous environment
• Shared-memory mutual exclusion: major research trends since 1986
• Some beautiful arguments using mathematical induction
• Speeding Lamport's fast mutual exclusion algorithm
• The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
• The epigenetic consensus problem
• The mutual exclusion problem
• The renaming problem in shared memory systems: an introduction
• Time, clocks, and the ordering of events in a distributed system
• Time-Adaptive Algorithms for Synchronization
• Unreliable failure detectors for reliable distributed systems

Cited in

(2)

• About informatics, distributed computing, and our job: a personal view
• Mutual exclusion vs consensus: both sides of the same coin?

This page was built for publication: A visit to mutual exclusion in seven dates

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