Peformance Prediction for Coarse-Grained Locking: MCS Case

Daniil Bolotov; Petr Kuznetsov; Vitaly Aksenov

Peformance Prediction for Coarse-Grained Locking: MCS Case

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.05545 v1 pith:6BGYOWL3 submitted 2021-10-11 cs.DC

Vitaly Aksenov , Daniil Bolotov , Petr Kuznetsov This is my paper · ORCID

classification cs.DC

keywords algorithmsanalysiscoarse-graineddatalocksectionsalreadyalternation

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Reciprocating Locks
cs.DC 2025-01 conditional novelty 6.0 of 10

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.

Pith tools