Performance Evaluation of Two-Shadow Speculative Concurrency Control
Files
Main article
Date
1993-02-05
DOI
Authors
Bestavros, Azer
Braoudakis, Spyridon
Panagos, Euthimios
Version
OA Version
Citation
Bestavros, Azer; Braoudakis, Spyridon; Panagos, Euthimios. "Performance Evaluation of Two-Shadow Speculative Concurrency Control", Technical Report BUCS-1993-001, Computer Science Department, Boston University, February 1993. [Available from: http://hdl.handle.net/2144/1458]
Abstract
Speculative Concurrency Control (SCC) [Best92a] is a new concurrency control approach especially suited for real-time database applications. It relies on the use of redundancy to ensure that serializable schedules are discovered and adopted as early as possible, thus increasing the likelihood of the timely commitment of transactions with strict timing constraints. In [Best92b], SCC-nS, a generic algorithm that characterizes a family of SCC-based algorithms was described, and its correctness established by showing that it only admits serializable histories. In this paper, we evaluate the performance of the Two-Shadow SCC algorithm (SCC-2S), a member of the SCC-nS family, which is notable for its minimal use of redundancy. In particular, we show that SCC-2S (as a representative of SCC-based algorithms) provides significant performance gains over the widely used Optimistic Concurrency Control with Broadcast Commit (OCC-BC), under a variety of operating conditions and workloads.