The Community for Technology Leaders
Green Image
<p>The concurrency control (CC) method employed can be critical to the performance of transaction processing systems. Conventional locking suffers from the blocking phenomenon, where waiting transactions continue to hold locks and block other transactions from progressing. In a high data contention environment, as an increasing number of transactions wait, a larger number of lock requests get blocked and fewer lock requests can get through. The proposed scheme reduces the blocking probability by deferring the blocking behavior of transactions to the later stages of their execution. By properly balancing the blocking and abort effects, the proposed scheme can lead to better performance than either the conventional locking or the optimistic concurrency control (OCC) schemes at all data and resource contention levels. We consider both static and dynamic approaches to determine when to switch from the nonblocking phase to the blocking phase. An analytical model is developed to estimate the performance of this scheme and determine the optimal operating or switching point. The accuracy of the analytic model is validated through a detailed simulation.</p>
concurrency control; locking; deferred blocking; transaction processing systems; performance analysis; high data contention environment; blocking probability; optimistic concurrency control; resource contention; switching point; simulation; concurrency control; distributed databases; performance evaluation; transaction processing

P. Yu and D. Dias, "Performance Analysis of Concurrency Control Using Locking with Deferred Blocking," in IEEE Transactions on Software Engineering, vol. 19, no. , pp. 982-996, 1993.
90 ms
(Ver 3.3 (11022016))