Removing Performance Bottleneck of Timestamp Allocation in Two-Phase Locking Based Protocol

Nakamori, Tatsuhiro; Nemoto, Jun; Hoshino, Takashi; Kawashima, Hideyuki

doi:10.1007/978-3-031-15512-3_18

Cited by 8 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Problemmentioning

confidence: 99%

“…To deal with highly contended situations in concurrency control, various protocols have been studied [12,14,17,19,29,30]. 2 phase locking (2PL) based protocols [2,17,20,21,27] pessimistically access records to reduce aborts. Multi-version concurrency control (MVCC) based protocols [11,12,14,19] exploit the theoretically larger scheduling space than 2PL.…”

Section: Problemmentioning

confidence: 99%

“…They are the concurrency control module and the logging and recovery module. This paper focuses only on the concurrency control module like some other studies [12,14,16,17,27,28,34]. The concurrency control is for providing isolation property, and the strongest level is called serializable.…”

Section: Concurrency Controlmentioning

confidence: 99%

See 2 more Smart Citations

CLMD: Making Lock Manager Predictable and Concurrent for Deterministic Concurrency Control

Uchida,

Kawashima

2024

IJNC

Self Cite

View full text Add to dashboard Cite

Transaction processing is common in our daily lives, and various protocols have been studied to manage concurrency control. One such protocol is the deterministic concurrency control protocol, which is highly efficient in handling workloads with high contention because of its deterministic transaction scheduling nature. This paper introduces a new lock manager, the concurrent lock manager for determinism or CLMD. CLMD allows non-conflicting transactions to be executed concurrently on deterministic concurrency control protocols. The concept is to check for conflicts between the current and all future transactions while the conventional scheme checks only the current and the following ones. The CLMD eliminates the bottleneck present in the conventional locking scheme used in the original Calvin paper. We evaluated CLMD with Calvin in experiments. The results showed that the proposed method outperformed SS2PL under high-contention workloads and performed better than Calvin under low and highcontention workloads. The maximum performance improvement observed was approximately 44.4 times using 64 logical cores.

show abstract

Section: Problemmentioning

confidence: 99%

Section: Problemmentioning

confidence: 99%

See 1 more Smart Citation

CLMD: Making Lock Manager Predictable and Concurrent for Deterministic Concurrency Control

Uchida,

Kawashima

2024

IJNC

Self Cite

View full text Add to dashboard Cite

show abstract

“…Our code is available online for reproduction [13]. This paper is an extension of our previous studies [14], [15]. This paper mainly added the following: investigation of the effect of centralized atomic counter by comparison with Snapshot Isolation, experimental evaluation with TPC-C workload, and application of Fair-TID to Wound-Wait and Wait-Die.…”

Section: Contributionmentioning

confidence: 99%

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

Nakamori

Nemoto²,

Hoshino

et al. 2023

Journal of Information Processing

Self Cite

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

“…3 A transaction processing system mainly consists of concurrency control (CC) and recovery. 4 In response to the rise of many-core architecture, various CC protocols have been proposed [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20] and evaluated [21][22][23] in recent years.…”

Section: Introductionmentioning

confidence: 99%

EPO‐R: An efficient garbage collection scheme for long‐term transactions

Onishi,

Hoshino,

Kawashima

2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThis article proposes EPO‐R, which is an efficient garbage collection scheme designed for multi‐version concurrency control (MVCC) protocols. MVCC generates a version for each update operation, and it can exhaust physical memory for dynamically changing environments such as IoT payments. Eager pruning of obsolete versions (EPO) is a novel garbage collection technique for long‐term transactions. We found room for improvement in EPO, which triggers reclamation invocation. EPO is triggered for each write operation, and it wastes CPU resources. The proposed method EPO‐R is triggered on a read operation to address this issue. The result of experiments with 64 CPU cores and workloads with the combination of short‐term and long‐term transactions demonstrated that EPO‐R exhibited 6.3 times higher throughput than that of EPO. The reason for this can be explained by analyzing the number of unreclaimable versions.

show abstract

Removing Performance Bottleneck of Timestamp Allocation in Two-Phase Locking Based Protocol

Cited by 8 publications

References 6 publications

CLMD: Making Lock Manager Predictable and Concurrent for Deterministic Concurrency Control

CLMD: Making Lock Manager Predictable and Concurrent for Deterministic Concurrency Control

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

EPO‐R: An efficient garbage collection scheme for long‐term transactions

Contact Info

Product

Resources

About