Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors.¶
Mellor-Crummey, J. M., & Scott, M. L. (1991). Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACM Transactions on Computer Systems, 9(1), 21-65.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Race Condition
- It predicts that adding capacity or participants — without changing the ordering regime — makes contention worse rather than better, because contention is a property of the rate of concurrent access to the critical region, not of average load.
This sourceShows that lock contention scales with the rate of concurrent access to the critical section (frequency of requests and hold time), not with average load — adding contending participants worsens it.
Supported in partVerified against the work's full text
MCS paper shows naive spin-lock contention worsens as more processors compete, while queue-based locks avoid it; it does not say contention depends on rate of access rather than average load.
“typical implementations of busy-waiting tend to produce large amounts of memory and interconnection network contention, which causes performance bottlenecks that become markedly more pro- nounced in larger machines and applications.”
- It predicts that adding capacity or participants — without changing the ordering regime — makes contention worse rather than better, because contention is a property of the rate of concurrent access to the critical region, not of average load.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:433a1880f91c · see in the full table