loading...
A Performance Evaluation of a Temporally Correct and Optimistic Concurrency Control Protocol
Fort Worth, Texas October 11-October 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MASCOT.2002.116710910th IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
In this paper, we focus on the temporary return of data values that are incorrect for given transactional semantics and could have catastrophic effects similar to those in parallel and discrete event simulation [8, 12]. In many applications using On-Line Transaction Processing (OLTP) environments, for instance, it is best to delay the response to a transaction?s read request until it is either known or unlikely that a write message from an older update transaction will not make the response incorrect. Examples of such applications are those where aberrant behavior is too costly, and those in which precommitted data is visible to some reactive entity. In light of the avoidance of risk in this approach, we propose a Risk-free Multiversion Temporally Correct (RFMVTC) concurrency control algorithm. We discuss the algorithm, its implementation and report on the performance results of simulation models using a cluster of workstations.
Citation:
A. Boukerche, T. W. Tuck, S. Hong, "A Performance Evaluation of a Temporally Correct and Optimistic Concurrency Control Protocol," mascots, pp.0471, 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.