Value-cognizant Speculative Concurrency Control

OpenBU

Show simple item record

dc.contributor.author Bestavros, Azer en_US
dc.contributor.author Braoudakis, Spyridon en_US
dc.date.accessioned 2011-10-20T04:32:18Z
dc.date.available 2011-10-20T04:32:18Z
dc.date.issued 1995-02-20 en_US
dc.identifier.uri http://hdl.handle.net/2144/1566
dc.description.abstract 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. en_US
dc.description.sponsorship National Science Foundation (CCR-9308344) en_US
dc.language.iso en_US en_US
dc.publisher Boston University Computer Science Department en_US
dc.relation.ispartofseries BUCS Technical Reports;BUCS-TR-1995-005 en_US
dc.title Value-cognizant Speculative Concurrency Control en_US
dc.type Technical Report en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU


Advanced Search

Browse

Deposit Materials