CLoF: A Compositional Lock Framework for Multi-level NUMA Systems
Rafael Lourenco de Lima Chehab, Antonio Paolillo, Diogo Behrens, Ming Fu, Hermann Härtig, Haibo Chen
Abstract
Efficient locking mechanisms are extremely important to support large-scale concurrency and exploit the performance promises of many-core servers. Implementing an efficient, generic, and correct lock is very challenging due to the differences between various NUMA architectures. The performance impact of architectural/NUMA hierarchy differences between x86 and Armv8 are not yet fully explored, leading to unexpected performance when simply porting NUMAaware locks from x86 to Armv8. Moreover, due to the Armv8 Weak Memory Model (WMM), correctly implementing complicated NUMA-aware locks is very difficult.
We propose a Compositional Lock Framework (CLoF) for multi-level NUMA systems. CLoF composes NUMAoblivious locks in a hierarchy matching the target platform, leading to hundreds of correct by construction NUMA-aware locks. CLoF can automatically select the best lock among them. To show the correctness of CLoF on WMMs, we provide an inductive argument with base and induction steps verified with model checkers. In our evaluation, CLoF locks outperform state-of-the-art NUMA-aware locks in most scenarios, e.g., in a highly contended LevelDB benchmark, our best CLoF locks yield twice the throughput achieved with CNA lock and ShflLock on large x86 and Armv8 servers.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ff4ad284-bd4c-43fd-881f-8cab2387c216Cited by top-tier papers10
- Asymmetry-aware scalable lockingNian Liu, Jinyu Gu, Dahai Tang, Kenli Li et al.PPoPP 2022 · 7 citations
- CPS: A Cooperative Para-virtualized Scheduling Framework for Manycore MachinesYuxuan Liu, Tianqiang Xu, Zeyu Mi, Zhichao Hua et al.ASPLOS 2023 · 5 citations
- BWoS: Formally Verified Block-based Work Stealing for Parallel ProcessingJiawei Wang, Bohdan Trach, Ming Fu, Diogo Behrens et al.OSDI 2023 · 5 citations
- Using Dynamically Layered Definite Releases for Verifying the RefFS File SystemMo Zou, Dong Du, Mingkai Dong, Haibo ChenOSDI 2024 · 4 citations
- RON: One-Way Circular Shortest Routing to Achieve Efficient and Bounded-waiting SpinlocksShiwu Lo, Han-Ting Lin, Yao-Hung Hsieh, Chao-Ting Lin et al.OSDI 2023 · 2 citations
Builds on2
- VSync: push-button verification and optimization for synchronization primitives on weak memory modelsJonas Oberhauser, Rafael Lourenco de Lima Chehab, Diogo Behrens, Ming Fu et al.ASPLOS 2021 · 40 citations
- No barrier in the road: a comprehensive study and optimization of ARM barriersNian Liu, Binyu Zang, Haibo ChenPPoPP 2020 · 10 citations
Related papers
- Locks as a Resource: Fairly Scheduling Lock Occupation with CFLJonggyu Park, Young Ik EomPPoPP 2024
- Efficient, Scalable, and Fair Locking on Disaggregated Memory with Decentralized CoordinationHanze Zhang, Ke Cheng, Rong Chen, Xingda Wei et al.VLDB 2026
- AutoLock: Why Cache Attacks on ARM Are Harder Than You ThinkMarc Green, Leandro Rodrigues Lima, Andreas Zankl, Gorka Irazoqui et al.USENIX Security 2017 · 51 citations
- ShiftLock: Mitigate One-sided RDMA Lock Contention via HandoverJian Gao, Qing Wang, Jiwu ShuFAST 2025 · 10 citations
- Rely/Guarantee Reasoning for Multicopy Atomic Weak Memory ModelsNicholas Coughlin, Kirsten Winter, Graeme SmithFM 2021 · 16 citations
