Lotus: Optimizing Disaggregated Transactions with Disaggregated Locks
Zhisheng Hu, Pengfei Zuo, Junliang Hu, Yizou Chen, Yingjia Wang, Ming-Chang Yang

TL;DR
Lotus is a distributed transaction system that disaggregates locks from data on disaggregated memory, using a lock-first protocol and lock management on compute nodes to significantly improve throughput and latency.
Contribution
It introduces lock disaggregation and a lock-first transaction protocol to eliminate bottlenecks at memory nodes, enhancing scalability and efficiency in disaggregated memory systems.
Findings
Up to 2.1× increase in transaction throughput
Latency reduced by up to 49.4%
Effective lock management on compute nodes
Abstract
Disaggregated memory (DM) separates compute and memory resources, allowing flexible scaling to achieve high resource utilization. To ensure atomic and consistent data access on DM, distributed transaction systems have been adapted, where compute nodes (CNs) rely on one-sided RDMA operations to access remote data in memory nodes (MNs). However, we observe that in existing transaction systems, the RDMA network interface cards at MNs become a primary performance bottleneck. This bottleneck arises from the high volume of one-sided atomic operations used for locks, which hinders the system's ability to scale efficiently. To address this issue, this paper presents Lotus, a scalable distributed transaction system with lock disaggregation on DM. The key innovation of Lotus is to disaggregate locks from data and execute all locks on CNs, thus eliminating the bottleneck at MN RNICs. To achieve…
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 · Cloud Computing and Resource Management · Advanced Data Storage Technologies
