Releasing Locks As Early As You Can: Reducing Contention of Hotspots by Violating Two-Phase Locking

Guo, Zhihan; Wu, Kan; Yan, Cong; Yu, Xiangyao

doi:10.1145/3448016.3457294

Cited by 15 publications

(11 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reason is the overhead of maintaining and referring long list of read and write sets. This limitation can be removed by (1) utilizing an efficient data structure for maintaining read and write sets, (2) using improved versions of lock‐based and optimistic concurrency control algorithms, for example, References 40–42, (3) utilizing a more effective hash data structure for indexing moving objects and handling their consistency. In future, we aim to apply such improvements and perform extensive performance evaluation by involving more index structures proposed in the literature for moving objects.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Exploiting hashing for concurrent query processing and indexing of current location of moving objects

Chaudhry,

Yousaf

2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryDue to recent developments in location‐based services and mobile computing, the need for indices for moving objects has been strengthened to improve the response time of a query operation. With a single index in place for managing both the update and query operations for moving objects, the index needs to be updated each time the object moves. This deteriorates the performance of concurrent query operations. It is critical to handle the conflicts between continuous update and query operations effectively using appropriate concurrency control protocol otherwise, inconsistent results will be reported. Many indices have been proposed in the literature for moving objects but they lack the support for processing concurrent operations. Further, the consistent indices in the literature are based on tree structure that have computationally expensive split/merge operations that can negatively affect the response time of query processing algorithms. Moreover such tree based indices are proposed for historical and future timeline data. As the scope of this article is on current timeline and concurrent continuous query operations, therefore, we exploit state of the art hash‐based indices in the literature and presented the two consistent versions. The comparative analysis of the indices is performed and meaningful findings are also presented along.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Therefore, we tried to keep the concurrency control algorithm simple and focused on data structure aspects to achieve consistency of query results without performance degradation. However, in the future, we plan to incorporate the existing complex concurrency control algorithms 40–42 to indices for moving objects.…”

Section: Problem Descriptionmentioning

confidence: 99%

Exploiting hashing for concurrent query processing and indexing of current location of moving objects

Chaudhry,

Yousaf

2024

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Its main idea is to release the acquired locks at an early stage to reduce the blocking time and aggressively operate dirty reads to increase concurrency. As shown in the original paper [7], Bamboo can outperform other state-of-the-art…”

Section: Introduction 11 Motivationmentioning

confidence: 90%

Scalable Timestamp Allocation for Deadlock Prevention in Two-phase Locking based Protocols

Nakamori

Nemoto²,

Hoshino

et al. 2023

Journal of Information Processing

View full text Add to dashboard Cite

Concurrency control ensures the correctness of databases when transactions are processed in parallel. Bamboo is a state-of-the-art concurrency control protocol extended from 2PL Wound-Wait. One problem of Bamboo is that it requires transactions to fetch timestamps from a single centralized atomic counter. To replace the concentrated access to it, each transaction should generate timestamps independently. This paper proposes three methods of decentralization to address the problem. The first is the thread-ID method (TID), which dismisses the process of fetching timestamps entirely by assigning an ID to each thread, and transactions use the thread IDs as their timestamps. In high-contention settings, the performance of TID plummets, but the second method FairTID, which is an extension of TID, sustains the performance even in such settings. The third method (RandID) allocates timestamps using randomnumber generators. Experiments were conducted to evaluate the performance of the proposed methods. The results indicated that there were up to 62% and 59% improvement in throughput from Bamboo with FairTID and RandID, respectively. In high-contention settings, TID underperformed Bamboo, but FairTID and RandID showed consistent improvement from Bamboo.

show abstract

“…Bamboo is designed for highly contended workloads and an extension of 2PL [1]. Its main idea is to release the acquired locks at an early stage to reduce the blocking time and increase concurrency.…”

Section: Motivation: Centralized 2plmentioning

confidence: 99%

“…Bamboo can be faster than other state-of-the-art concurrency-control protocols under conditions in which hotspot accesses limit transaction throughput. Bamboo implements the wound-wait method for deadlock prevention among transactions [1]. Wound-wait resolves deadlocks by making transactions of higher priority abort other transactions.…”

Section: Motivation: Centralized 2plmentioning

confidence: 99%

Decentralization of Two Phase Locking based Protocols

Nakamori

Nemoto²,

Hoshino

et al. 2022

Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing

View full text Add to dashboard Cite

Bamboo is a state-of-the-art concurrency control protocol based on the 2-phase locking protocol. One problem of Bamboo is that it requires transactions to fetch timestamps from a single centralized atomic counter. To replace the concentrated access to it, each transaction should generate timestamps independently. This paper proposes thread-ID method (TID), which dismisses the process of fetching timestamps entirely by assigning an ID to each thread, and transactions use the thread IDs as their timestamps. In high-contention settings, the performance of TID plummets, but proposed optimization FairTID sustains the performance. The experiments measured an improvement of up to 60% from Bamboo with the proposed method.

show abstract

Releasing Locks As Early As You Can: Reducing Contention of Hotspots by Violating Two-Phase Locking

Cited by 15 publications

References 31 publications

Exploiting hashing for concurrent query processing and indexing of current location of moving objects

Exploiting hashing for concurrent query processing and indexing of current location of moving objects

Scalable Timestamp Allocation for Deadlock Prevention in Two-phase Locking based Protocols

Decentralization of Two Phase Locking based Protocols

Contact Info

Product

Resources

About