Affiliation:
1. Simon Fraser University, Burnaby, Canada
Abstract
Modern memory-optimized indexes often use optimistic locks for concurrent accesses. Read operations can proceed optimistically without taking the lock, greatly improving performance on multicore CPUs. But this is at the cost of robustness against contention where many threads contend on a small set of locks, causing excessive cacheline invalidation, interconnect traffic and eventually performance collapse. Yet existing solutions often sacrifice desired properties such as compact 8-byte lock size and fairness among lock requesters.
This paper presents optimistic queuing lock (OptiQL), a new optimistic lock for database indexing to solve this problem. OptiQL extends the classic MCS lock---a fair, compact and robust mutual exclusion lock---with optimistic read capabilities for index workloads to achieve both robustness and high performance while maintaining various desirable properties. Evaluation using memory-optimized B+-trees on a 40-core, dual-socket server shows that OptiQL matches existing optimistic locks for read operations, while avoiding performance collapse under high contention.
Publisher
Association for Computing Machinery (ACM)
Reference47 articles.
1. Adnan Alhomssi and Viktor Leis . 2021 . Contention and Space Management in B-Trees. In Conference on Innovative Data Systems Research (CIDR 2021). Adnan Alhomssi and Viktor Leis. 2021. Contention and Space Management in B-Trees. In Conference on Innovative Data Systems Research (CIDR 2021).
2. The performance of spin lock alternatives for shared-money multiprocessors
3. BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory;Arulraj Joy;PVLDB,2018
4. Concurrency of operations on B-trees
5. HOT