Hapax Locks: Scalable Value-Based Mutual Exclusion
Dave Dice, Alex Kogan
Abstract
We present Hapax Locks, a novel locking algorithm that is simple, enjoys constant-time arrival and unlock paths, provides FIFO admission order, and which is also space efficient and generates relatively little coherence traffic under contention in the common case. Hapax Locks offer performance (both latency and scalability) that is comparable with the best state of the art locks, while at the same time Hapax Locks impose fewer constraints and dependencies on the ambient runtime environment, making them particularly easy to integrate or retrofit into existing systems or under existing lock application programming interfaces.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 1a3aae4f-a8d7-4396-8f41-f14fe8c1bf66Cited by top-tier papers1
Ask how each one uses itRelated papers
- Fairer and More Scalable Reader-Writer Locks by Optimizing Queue ManagementTakashi Hoshino, Kenjiro TauraPPoPP 2025 · 1 citation
- Locks as a Resource: Fairly Scheduling Lock Occupation with CFLJonggyu Park, Young Ik EomPPoPP 2024
- FARLock: Asymmetric RDMA Locking Made FairYuehao Hu, Jiatang Zhou, Tianzheng Wang, Keval VoraOSDI 2026
- Fast and Scalable In-network Lock Management Using Lock FissionHanze Zhang, Ke Cheng, Rong Chen, Haibo ChenOSDI 2024 · 9 citations
- Scaling Up Transactions with Slower ClocksPedro Ramalhete, Andreia CorreiaPPoPP 2024 · 4 citations
