Shared-memory mutual exclusion: major research trends since 1986

DOI10.1007/s00446-003-0088-6zbMath1448.68061DBLPjournals/dc/AndersonKH03OpenAlexW2087801709WikidataQ55866746 ScholiaQ55866746MaRDI QIDQ5138486

Yong-Jik Kim, Ted Herman, James H. Anderson

Publication date: 4 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-003-0088-6

zbMATH Keywords

time complexityadaptive mutual exclusionshared-memory systemslocal spinningnonatomic algorithmsgroup mutual exclusiontiming-based algorithms\(k\)-exclusionfast mutual exclusion

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (11)

A visit to mutual exclusion in seven dates ⋮ On the inherent weakness of conditional primitives ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms ⋮ Reconciling fault-tolerant distributed algorithms and real-time computing ⋮ Recoverable mutual exclusion ⋮ To compose, or not to compose, that is the question: an analysis of compositional state space generation ⋮ Towards a real-time distributed computing model ⋮ A mutual exclusion algorithm with optimally bounded bypasses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arbitration without common modifiable variables
• Myths about the mutual exclusion problem
• N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable
• Speeding Lamport's fast mutual exclusion algorithm
• Bounds on shared memory for mutual exclusion
• A space- and time-efficient local-spin spin lock.
• Wait-free algorithms for fast, long-lived renaming
• Time/contention trade-offs for multiprocessor synchronization
• Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
• Analysis of timing-based mutual exclusion with random times
• A simple local-spin group mutual exclusion algorithm
• A New Approach to Proving the Correctness of Multiprocess Programs
• Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
• Contention in shared memory algorithms
• Lower Bounds for Randomized Mutual Exclusion
• A new solution of Dijkstra's concurrent programming problem
• Adaptive solutions to the mutual exclusion problem
• A fast, scalable mutual exclusion algorithm
• Using local-spin k -exclusion algorithms to improve wait-free object implementations
• Asynchronous group mutual exclusion
• A new fast-path mechanism for mutual exclusion
• Nonatomic mutual exclusion with local spinning
• Non-blocking timeout in scalable queue-based spin locks
• Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
• Adaptive and efficient mutual exclusion (extended abstract)
• Improving fast mutual exclusion
• Randomized mutual exclusion algorithms revisited
• Long-lived renaming made fast
• The mutual exclusion problem
• The mutual exclusion problem
• Self-stabilizing \(\ell\)-exclusion

This page was built for publication: Shared-memory mutual exclusion: major research trends since 1986