Ship your Critical Section, Not Your Data: Enabling Transparent Delegation with TCLOCKS
Vishal Gupta, Kumar Kartikeya Dwivedi, Yugesh Kothari, Yueyang Pan, Diyu Zhou, Sanidhya Kashyap
Abstract
Today's high-performance applications heavily rely on various synchronization mechanisms, such as locks. While locks ensure mutual exclusion of shared data, their design impacts application scalability. Locks, as used in practice, move the lock-guarded shared data to the core holding it, which leads to shared data transfer among cores. This design adds unavoidable critical path latency leading to performance scalability issues. Meanwhile, some locks avoid this shared data movement by localizing the access to shared data on one core, and shipping the critical section to that specific core. However, such locks require modifying applications to explicitly package the critical section, which makes it virtually infeasible for complicated applications with large code bases, such as the Linux kernel.
We propose transparent delegation, in which a waiter automatically encodes its critical section information on its stack and notifies the combiner (lock holder). The combiner executes the shipped critical section on the waiter's behalf using a lightweight context switch. Using transparent delegation, we design a family of locking protocols, called TCLocks, that requires zero modification to applications' logic. The evaluation shows that TCLocks provide up to 5.2× performance improvement compared with recent locking algorithms.
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 3fe83254-ce9e-407a-a0e3-841074fc06d2Cited by top-tier papers4
- ShiftLock: Mitigate One-sided RDMA Lock Contention via HandoverJian Gao, Qing Wang, Jiwu ShuFAST 2025 · 10 citations
- Concurrent Data Structures Made EasyCallista Le, Kiran Gopinathan, Koon Wen Lee, Seth Gilbert et al.OOPSLA 2024 · 2 citations
- FlexGuard: Fast Mutual Exclusion Independent of SubscriptionVictor Laforet, Sanidhya Kashyap, Calin Iorgulescu, Julia Lawall et al.SOSP 2025
- Operation-aware Hybrid Locking for Modern In-Memory IndexesVishal Gupta, Martin Sanchez Lopez, Victor Laforet, Jean-Pierre Lozi et al.VLDB 2026
Builds on1
Related papers
- Binary Compatible Critical Section DelegationJunyao Zhang, Zhuo Wang, Zhe ZhouPPoPP 2026
- 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
- Fairer and More Scalable Reader-Writer Locks by Optimizing Queue ManagementTakashi Hoshino, Kenjiro TauraPPoPP 2025 · 1 citation
- Scalable RDMA-accelerated Distributed Locks with Shared Stream AbstractionMiao Cai, Junru Shen, Xiaojian Liao, Rong Gu et al.EuroSys 2026
