On the public citation graph

A fast, scalable mutual exclusion algorithm

0 signed · 117 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot

Parallel Program Design

inferredcites →https://doi.org/10.1007/bf00288966openalex-snapshot

Arbitration without common modifiable variables

inferredcites →https://doi.org/10.1007/bf01179373openalex-snapshot

A fine-grained solution to the mutual exclusion problem

inferredcites →https://doi.org/10.1080/00029890.1995.12004627openalex-snapshot

How to Write a Proof

inferredcites →https://doi.org/10.1109/2.55501openalex-snapshot

Synchronization algorithms for shared-memory multiprocessors

inferredcites →https://doi.org/10.1109/71.80120openalex-snapshot

The performance of spin lock alternatives for shared-memory multiprocessors

inferredcites →https://doi.org/10.1109/isca.1989.714578openalex-snapshot

Adaptive Backoff Synchronization Techniques

inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot

Algorithms for scalable synchronization on shared-memory multiprocessors

inferredcites →https://doi.org/10.1145/135419.135453openalex-snapshot

Improving fast mutual exclusion

inferredcites →https://doi.org/10.1145/164051.164072openalex-snapshot

Fast, scalable synchronization with minimal hardware support

inferredcites →https://doi.org/10.1145/195058.195139openalex-snapshot

Time bounds for mutual exclusion and related problems

inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot

Solution of a problem in concurrent programming control

inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot

Solution of a problem in concurrent programming control

inferredcites →https://doi.org/10.1145/7351.7352openalex-snapshot

A fast mutual exclusion algorithm

inferredcites →https://doi.org/10.1145/74925.74970openalex-snapshot

Adaptive backoff synchronization techniques

inferredcites →https://doi.org/10.1145/800105.803398openalex-snapshot

Economical solutions for the critical section problem in a distributed system (Extended Abstract)

inferredcites →https://doi.org/10.21236/ada272947openalex-snapshot

Fast Mutual Exclusion, Even with Contention

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.3263openalex-snapshot

High‐performanceN‐thread software solutions for mutual exclusion

inferred← citeshttps://doi.org/10.1002/cpe.4183openalex-snapshot

Fast mutual exclusion by the Triangle algorithm

inferred← citeshttps://doi.org/10.1006/inco.1996.0006openalex-snapshot

Time/Contention Trade-Offs for Multiprocessor Synchronization

inferred← citeshttps://doi.org/10.1007/11823285_56openalex-snapshot

A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks

inferred← citeshttps://doi.org/10.1007/3-540-40026-5_2openalex-snapshot

Adaptive Mutual Exclusion with Local Spinning

inferred← citeshttps://doi.org/10.1007/3-540-45414-4_1openalex-snapshot

A Time Complexity Bound for Adaptive Mutual Exclusion

inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_605openalex-snapshot

Mellor-Crummey and Scott Mutual Exclusion Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-031-20002-1_3openalex-snapshot

Prior Work

inferred← citeshttps://doi.org/10.1007/978-3-031-20002-1_5openalex-snapshot

Load and Store Based Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_6openalex-snapshot

Local-Spin Group Mutual Exclusion Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_24openalex-snapshot

Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion

inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_3openalex-snapshot

Timing-Based Mutual Exclusion with Local Spinning

inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_41openalex-snapshot

Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems

inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_7openalex-snapshot

Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion

inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_18openalex-snapshot

Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-642-15898-8_12openalex-snapshot

A Study of Shared-Memory Mutual Exclusion Protocols Using CADP

inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_605-1openalex-snapshot

Mellor-Crummey and Scott Mutual Exclusion Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_19openalex-snapshot

RMR-Efficient Randomized Abortable Mutual Exclusion

inferred← citeshttps://doi.org/10.1007/bfb0056497openalex-snapshot

Deriving a scalable algorithm for mutual exclusion

inferred← citeshttps://doi.org/10.1007/pl00008923openalex-snapshot

A new fast-path mechanism for mutual exclusion

inferred← citeshttps://doi.org/10.1007/s00446-003-0088-6openalex-snapshot

Shared-memory mutual exclusion: major research trends since 1986

inferred← citeshttps://doi.org/10.1007/s00446-005-0136-5openalex-snapshot

On the inherent weakness of conditional primitives

inferred← citeshttps://doi.org/10.1007/s00446-006-0003-zopenalex-snapshot

Nonatomic mutual exclusion with local spinning

inferred← citeshttps://doi.org/10.1007/s00446-006-0009-6openalex-snapshot

Adaptive mutual exclusion with local spinning

inferred← citeshttps://doi.org/10.1007/s00446-010-0096-2openalex-snapshot

Closing the complexity gap between FCFS mutual exclusion and mutual exclusion

inferred← citeshttps://doi.org/10.1007/s00446-011-0128-6openalex-snapshot

Randomized mutual exclusion with sub-logarithmic RMR-complexity

inferred← citeshttps://doi.org/10.1007/s00446-011-0150-8openalex-snapshot

RMR-efficient implementations of comparison primitives using read and write operations

inferred← citeshttps://doi.org/10.1007/s00446-011-0152-6openalex-snapshot

A time complexity lower bound for adaptive mutual exclusion

inferred← citeshttps://doi.org/10.1007/s00446-019-00364-0openalex-snapshot

Recoverable mutual exclusion

inferred← citeshttps://doi.org/10.1007/s004460050039openalex-snapshot

Using local-spin k -exclusion algorithms to improve wait-free object implementations

inferred← citeshttps://doi.org/10.1007/s004460100068openalex-snapshot

Adaptive and efficient mutual exclusion

inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.07.002openalex-snapshot

A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model

inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.11.006openalex-snapshot

A generic local-spin fetch-and--based mutual exclusion algorithm

inferred← citeshttps://doi.org/10.1016/j.scico.2012.01.003openalex-snapshot

Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.030openalex-snapshot

Group mutual exclusion in linear time and space

inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00224-7openalex-snapshot

A space- and time-efficient local-spin spin lock

inferred← citeshttps://doi.org/10.1109/71.862205openalex-snapshot

A fair distributed mutual exclusion algorithm

inferred← citeshttps://doi.org/10.1109/71.940743openalex-snapshot

A simple local-spin group mutual exclusion algorithm

inferred← citeshttps://doi.org/10.1109/aina.2008.116openalex-snapshot

Efficient Synchronization in Message Passing Systems

inferred← citeshttps://doi.org/10.1109/cbase57816.2022.00016openalex-snapshot

The Advance and Analysis of Memory allocations

inferred← citeshttps://doi.org/10.1109/cisis.2008.132openalex-snapshot

Latency Impact on Spin-Lock Algorithms for Modern Shared Memory Multiprocessors

inferred← citeshttps://doi.org/10.1109/focs.2011.66openalex-snapshot

The Complexity of Renaming

inferred← citeshttps://doi.org/10.1109/focs.2011.84openalex-snapshot

Mutual Exclusion with O(log^2 Log n) Amortized Work

inferred← citeshttps://doi.org/10.1109/focs.2014.60openalex-snapshot

Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM

inferred← citeshttps://doi.org/10.1109/focs.2014.61openalex-snapshot

Sample-Optimal Fourier Sampling in Any Constant Dimension

inferred← citeshttps://doi.org/10.1109/icdcs.2003.1203505openalex-snapshot

Local-spin mutual exclusion using fetch-and-Φ primitives

inferred← citeshttps://doi.org/10.1109/icdcs.2005.83openalex-snapshot

Transformations of Mutual Exclusion Algorithms from the Cache-Coherent Model to the Distributed Shared Memory Model

inferred← citeshttps://doi.org/10.1109/icpp.2002.1040883openalex-snapshot

Region synchronization in message passing systems

inferred← citeshttps://doi.org/10.1145/1011767.1011780openalex-snapshot

On the inherent weakness of conditional synchronization primitives

inferred← citeshttps://doi.org/10.1145/1146381.1146423openalex-snapshot

An Ω ( n log n ) lower bound on the cost of mutual exclusion

inferred← citeshttps://doi.org/10.1145/1281100.1281105openalex-snapshot

Constant-RMR implementations of CAS and other synchronization primitives using read and write operations

inferred← citeshttps://doi.org/10.1145/1374376.1374410openalex-snapshot

Tight RMR lower bounds for mutual exclusion and other problems

inferred← citeshttps://doi.org/10.1145/1400751.1400843openalex-snapshot

Tight RMR lower bounds for mutual exclusion and other problems

inferred← citeshttps://doi.org/10.1145/1582716.1582727openalex-snapshot

Randomized mutual exclusion in O(log N / log log N) RMRs

inferred← citeshttps://doi.org/10.1145/1835698.1835708openalex-snapshot

Group mutual exclusion in O (log n ) RMR

inferred← citeshttps://doi.org/10.1145/1835698.1835737openalex-snapshot

Adaptive randomized mutual exclusion in sub-logarithmic expected time

inferred← citeshttps://doi.org/10.1145/1835698.1835803openalex-snapshot

Constant RMR solutions to reader writer synchronization

inferred← citeshttps://doi.org/10.1145/1993636.1993687openalex-snapshot

Linearizable implementations do not suffice for randomized distributed computation

inferred← citeshttps://doi.org/10.1145/1993806.1993822openalex-snapshot

A complexity separation between the cache-coherent and distributed shared memory models

inferred← citeshttps://doi.org/10.1145/2145816.2145835openalex-snapshot

A methodology for creating fast wait-free data structures

inferred← citeshttps://doi.org/10.1145/2213977.2214065openalex-snapshot

Tight time-space tradeoff for mutual exclusion

inferred← citeshttps://doi.org/10.1145/2213977.2214066openalex-snapshot

A tight RMR lower bound for randomized mutual exclusion

inferred← citeshttps://doi.org/10.1145/2332432.2332479openalex-snapshot

Brief announcement

inferred← citeshttps://doi.org/10.1145/2370036.2145835openalex-snapshot

A methodology for creating fast wait-free data structures

inferred← citeshttps://doi.org/10.1145/2484239.2484255openalex-snapshot

An O(1)-barriers optimal RMRs mutual exclusion algorithm

inferred← citeshttps://doi.org/10.1145/2597630openalex-snapshot

Tight Bounds for Asynchronous Renaming

inferred← citeshttps://doi.org/10.1145/2767386.2767427openalex-snapshot

Trading Fences with RMRs and Separating Memory Models

inferred← citeshttps://doi.org/10.1145/2767386.2767428openalex-snapshot

The Price of being Adaptive

inferred← citeshttps://doi.org/10.1145/2833312.2833316openalex-snapshot

Group mutual exclusion in linear time and space

inferred← citeshttps://doi.org/10.1145/2851141.2851166openalex-snapshot

Contention-conscious, locality-preserving locks

inferred← citeshttps://doi.org/10.1145/2933057.2933087openalex-snapshot

Recoverable Mutual Exclusion

inferred← citeshttps://doi.org/10.1145/2933057.2933099openalex-snapshot

On the Complexity of Reader-Writer Locks

inferred← citeshttps://doi.org/10.1145/301308.301319openalex-snapshot

A simple local-spin group mutual exclusion algorithm

inferred← citeshttps://doi.org/10.1145/3016078.2851166openalex-snapshot

Contention-conscious, locality-preserving locks

inferred← citeshttps://doi.org/10.1145/3087801.3087819openalex-snapshot

Recoverable Mutual Exclusion in Sub-logarithmic Time

inferred← citeshttps://doi.org/10.1145/3212734.3212755openalex-snapshot

Recoverable Mutual Exclusion Under System-Wide Failures

inferred← citeshttps://doi.org/10.1145/3212734.3212759openalex-snapshot

Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity

inferred← citeshttps://doi.org/10.1145/3293611.3331634openalex-snapshot

A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM

inferred← citeshttps://doi.org/10.1145/3382734.3405736openalex-snapshot

Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives

inferred← citeshttps://doi.org/10.1145/3382734.3405739openalex-snapshot

An Adaptive Approach to Recoverable Mutual Exclusion

inferred← citeshttps://doi.org/10.1145/343477.343525openalex-snapshot

Adaptive and efficient mutual exclusion (extended abstract)

inferred← citeshttps://doi.org/10.1145/3465084.3467938openalex-snapshot

Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion

inferred← citeshttps://doi.org/10.1145/3490148.3538594openalex-snapshot

A NUMA-Aware Recoverable Mutex Lock

inferred← citeshttps://doi.org/10.1145/3558481.3591091openalex-snapshot

Protecting Locks Against Unbalanced Unlock()

inferred← citeshttps://doi.org/10.1145/3575693.3575714openalex-snapshot

A Prediction System Service

inferred← citeshttps://doi.org/10.1145/3583668.3594597openalex-snapshot

Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

inferred← citeshttps://doi.org/10.1145/3744236openalex-snapshot

Adaptive and Fair Transformation for Recoverable Mutual Exclusion

inferred← citeshttps://doi.org/10.1145/3816782.3819207openalex-snapshot

Fast Concurrent Primitives Despite Contention

inferred← citeshttps://doi.org/10.1145/383962.383996openalex-snapshot

An improved lower bound for the time complexity of mutual exclusion

inferred← citeshttps://doi.org/10.1145/383962.383997openalex-snapshot

A note on group mutual exclusion

inferred← citeshttps://doi.org/10.1145/571825.571827openalex-snapshot

Nonatomic mutual exclusion with local spinning

inferred← citeshttps://doi.org/10.11575/prism/18696openalex-snapshot

RMR-Efficient Randomized Abortable Mutual Exclusion

inferred← citeshttps://doi.org/10.1201/b16812-19openalex-snapshot

Distributed Algorithms

inferred← citeshttps://doi.org/10.24124/2017/54752openalex-snapshot

A framework to study the performance of the group mutual exclusion algorithms

inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.30openalex-snapshot

Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions

inferred← citeshttps://doi.org/10.48550/arxiv.1310.7397openalex-snapshot

Deconstructing Queue-Based Mutual Exclusion

inferred← citeshttps://doi.org/10.48550/arxiv.2001.04235openalex-snapshot

Notes on Theory of Distributed Systems

inferred← citeshttps://doi.org/10.48550/arxiv.2106.03185openalex-snapshot

Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion

inferred← citeshttps://doi.org/10.5075/epfl-thesis-5447openalex-snapshot

Randomized versus Deterministic Implementations of Concurrent Data Structures

inferred← citeshttps://doi.org/10.70675/196b1a95za1f3z4349z89e3z5fdf510248a6openalex-snapshot

Parallélisation et passage à l'échelle durable d'une chaïne de traitement graphique pour l'impression professionnelle

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.