On the public citation graph

High‐performanceN‐thread software solutions for mutual exclusion

https://doi.org/10.1002/cpe.3263
0 signed · 54 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.1002/9781118181287.ch9openalex-snapshot
Programming Languages
inferredcites →https://doi.org/10.1002/cpe.885openalex-snapshot
Concurrent urban legends
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1007/978-3-540-39989-6_10openalex-snapshot
Automatic Discovery of Mutual Exclusion Algorithms
inferredcites →https://doi.org/10.1007/bf00288966openalex-snapshot
Arbitration without common modifiable variables
inferredcites →https://doi.org/10.1007/bf01784242openalex-snapshot
A fast, scalable mutual exclusion algorithm
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/s00236-013-0178-2openalex-snapshot
Verifying a simplification of mutual exclusion by Lycklama–Hadzilacos
inferredcites →https://doi.org/10.1016/0020-0190(81)90100-9openalex-snapshot
An implementation of P and V
inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot
Myths about the mutual exclusion problem
inferredcites →https://doi.org/10.1016/j.jpdc.2013.03.009openalex-snapshot
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
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/88.481663openalex-snapshot
Evaluating and designing software mutual exclusion algorithms on shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/iita.workshops.2008.231openalex-snapshot
An Intelligent Multi-Port Memory
inferredcites →https://doi.org/10.1109/jcit.1990.128275openalex-snapshot
Mutual exclusion revisited
inferredcites →https://doi.org/10.1109/sfcs.1981.42openalex-snapshot
Symmetry in systems of asynchronous processes
inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/115372.115370openalex-snapshot
A first-come-first-served mutual-exclusion algorithm with small communication variables
inferredcites →https://doi.org/10.1145/135419.135453openalex-snapshot
Improving fast mutual exclusion
inferredcites →https://doi.org/10.1145/203241.203270openalex-snapshot
The first-course conundrum, why change?
inferredcites →https://doi.org/10.1145/355592.365595openalex-snapshot
Additional comments on a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/355606.361895openalex-snapshot
Further comments on Dijkstra's concurrent programming control problem
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/361082.361093openalex-snapshot
A new solution of Dijkstra's concurrent programming problem
inferredcites →https://doi.org/10.1145/362759.362813openalex-snapshot
Concurrent control with “readers” and “writers”
inferredcites →https://doi.org/10.1145/363162.363167openalex-snapshot
Additional comments on 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/512274.3734138openalex-snapshot
Algorithm 232: Heapsort
inferredcites →https://doi.org/10.1145/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
inferredcites →https://doi.org/10.1145/512429.512451openalex-snapshot
Mostly lock-free malloc
inferredcites →https://doi.org/10.1145/5383.5384openalex-snapshot
The mutual exclusion problem
inferredcites →https://doi.org/10.1145/5383.5385openalex-snapshot
The mutual exclusion problem
inferredcites →https://doi.org/10.1145/55364.55425openalex-snapshot
A simple solution to Lamport's concurrent programming problem with linear wait
inferredcites →https://doi.org/10.1145/7351.7352openalex-snapshot
A fast mutual exclusion algorithm
inferredcites →https://doi.org/10.1145/773039.512451openalex-snapshot
Mostly lock-free malloc
inferredcites →https://doi.org/10.1145/800105.803398openalex-snapshot
Economical solutions for the critical section problem in a distributed system (Extended Abstract)

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.3659openalex-snapshot
Dekker's mutual exclusion algorithm made RW‐safe
inferred← citeshttps://doi.org/10.1002/cpe.4183openalex-snapshot
Fast mutual exclusion by the Triangle algorithm
inferred← citeshttps://doi.org/10.1002/cpe.4475openalex-snapshot
High‐contention mutual exclusion by elevator algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-25703-7_6openalex-snapshot
Atomicity*
inferred← citeshttps://doi.org/10.1007/s00165-016-0364-4openalex-snapshot
Correctness and concurrent complexity of the Black-White Bakery Algorithm
inferred← citeshttps://doi.org/10.1007/s00165-016-0407-xopenalex-snapshot
Tournaments for mutual exclusion: verification and concurrent complexity
inferred← citeshttps://doi.org/10.1016/j.scico.2015.01.001openalex-snapshot
Mutual exclusion by four shared bits with not more than quadratic complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.030openalex-snapshot
A visit to mutual exclusion in seven dates
inferred← citeshttps://doi.org/10.1109/mascots.2016.72openalex-snapshot
Performance Evaluation of Fischer's Protocol through Steady-State Analysis of Markov Regenerative Processes
inferred← citeshttps://doi.org/10.1145/2688500.2688503openalex-snapshot
High performance locks for multi-level NUMA systems
inferred← citeshttps://doi.org/10.1145/3584696openalex-snapshot
MCSH, a Lock with the Standard Interface
inferred← citeshttps://doi.org/10.1145/3669989openalex-snapshot
First-Come-First-Served as a Separate Principle
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.3390/a17120536openalex-snapshot
Verifying Mutual Exclusion Algorithms with Non-Atomic Registers
inferred← citeshttps://doi.org/10.3390/computers13060133openalex-snapshot
Modeling and Analysis of Dekker-Based Mutual Exclusion Algorithms
inferred← citeshttps://doi.org/10.3390/modelling5030037openalex-snapshot
Correctness Verification of Mutual Exclusion Algorithms by Model Checking
inferred← citeshttps://doi.org/10.3934/aci.2025014openalex-snapshot
Formal verification of mutual exclusion algorithms in anonymous memory
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.