WoundDie: Concurrency Control Protocol with Lightweight Priority Control
Open Access
- 4 September 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 130-135
Abstract
Recent concurrency control protocols for database transactions employ priority control to deliver predictable latency. Conventional protocols either require complex data structures or provide incomplete priority control that has a parameter and does not ensure starvation-freedom. To address this issue, we propose a new protocol, WoundDie, which ensures starvation-freedom without parameters. Unlike conventional starvation-free protocols, it does not require complex data structures for locking, making it memory-efficient and easy to implement. Experimental results demonstrated that under a high contention workload, WoundDie exhibited tail latency that was 6.5 times lower than Polaris's best case and 80 times lower than its worst case.Keywords
Funding Information
- New Energy and Industrial Technology Development Organization (JPNP20017,JPNP16007)
- Japan Society for the Promotion of Science (22H03596)
This publication has 14 references indexed in Scilit:
- Plor: General Transactions with Predictable, Low Tail Latency2022
- Releasing Locks As Early As You Can: Reducing Contention of Hotspots by Violating Two-Phase Locking2021
- Cicada2017
- TicToc2016
- The Serial Safety Net2015
- FOEDUS2015
- Speedy transactions in multicore in-memory databases2013
- Benchmarking cloud serving systems with YCSB2010
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981
- System level concurrency control for distributed database systemsACM Transactions on Database Systems, 1978