Lightweight Contention Management for Efficient Compare-and-Swap Operations
Dave Dice, Danny Hendler, Ilya Mirsky

TL;DR
This paper investigates whether software-based contention management can enhance the performance of hardware compare-and-swap (CAS) operations, especially under medium and high contention, showing significant improvements with minimal overhead at low contention.
Contribution
It introduces lightweight contention management techniques that improve CAS efficiency in concurrent data structures under various contention levels.
Findings
Performance improves significantly under medium/high contention
Minimal overhead when contention is low
Software contention management effectively enhances hardware CAS operations
Abstract
Many concurrent data-structure implementations use the well-known compare-and-swap (CAS) operation, supported in hardware by most modern multiprocessor architectures for inter-thread synchronization. A key weakness of the CAS operation is the degradation in its performance in the presence of memory contention. In this work we study the following question: can software-based contention management improve the efficiency of hardware-provided CAS operations? Our performance evaluation establishes that lightweight contention management support can greatly improve performance under medium and high contention levels while typically incurring only small overhead when contention is low.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Parallel Computing and Optimization Techniques · Real-Time Systems Scheduling
