Show simple item record

dc.contributor.authorBestavros, Azeren_US
dc.contributor.authorBraoudakis, Spyridonen_US
dc.date.accessioned2011-10-20T04:32:18Z
dc.date.available2011-10-20T04:32:18Z
dc.date.issued1995-02-20en_US
dc.identifier.citationBestavros, Azer; Braoudakis, Spyridon. "Speculative Concurrency Control with Deferred Commitment for Real-Time Databases“, Technical Report BUCS-1995-005, Computer Science Department, Boston University, February 20, 1995. [Available from: http://hdl.handle.net/2144/1566]en_US
dc.identifier.urihttp://hdl.handle.net/2144/1566
dc.description.abstractA 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.sponsorshipNational Science Foundation (CCR-9308344)en_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-1995-005en_US
dc.titleValue-cognizant Speculative Concurrency Controlen_US
dc.typeTechnical Reporten_US


Files in this item

This item appears in the following Collection(s)

Show simple item record