Value-cognizant Speculative Concurrency Control
Azer Bestavros, Spyridon Braoudakis · 1995
A problem with Speculative Concurrency Control algorithms and other common concurrency control schemes using forward validation is that committing a transaction as soon as it finishes validating, may result in a value loss to the system. Haritsa showed that by making a lower priority transaction wait after it is validated, the number of transactions meeting their deadlines is increased, which may result in a higher value-added to the system. SCC-based protocols can benefit from the introduction of such delays by giving optimistic shadows with high value-added to the system more time to execute and commit instead of being aborted in favor of other validating transactions, whose value-added to the system is lower. In this paper we present and evaluate an extension to SCC algorithms that allows for commit deferments. This work has been partially supported by NSF (grant CCR-9308344). 1 Introduction Various concurrency control algorithms differ in the time when conflicts are detected,...