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.
- 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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:433a1880f91c · see in the full table