Reciprocating Locks is a new spin lock that combines an arrival stack, detached entry segments, and per-thread TLS wait elements to provide constant-time paths, local spinning, and bounded bypass.
Peformance Prediction for Coarse-Grained Locking: MCS Case
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. It was already shown that simple stochastic analysis can predict the throughput of coarse-grained lock-based algorithms using CLH lock. In this short paper, we extend this analysis to algorithms based on the popular MCS lock.
citation-role summary
other 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Reciprocating Locks
Reciprocating Locks is a new spin lock that combines an arrival stack, detached entry segments, and per-thread TLS wait elements to provide constant-time paths, local spinning, and bounded bypass.