A visit to mutual exclusion in seven dates

DOI10.1016/J.TCS.2022.03.030OpenAlexW4223933862MaRDI QIDQ2136281FDOQ2136281

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)

Cites Work

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

Cited In (1)

• About informatics, distributed computing, and our job: a personal view

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)