International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 1 - Number 21 |
Year of Publication: 2010 |
Authors: K M Prakash Lingam |
10.5120/54-648 |
K M Prakash Lingam . Analysis of Real-Time Multi version Concurrency Control Algorithms using Serialisability Graphs. International Journal of Computer Applications. 1, 21 ( February 2010), 57-62. DOI=10.5120/54-648
This paper analyzes the correctness of Multiversion Concurrency Control(MVCC) algorithms that are commonly deployed in Real-time Databases. Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and is represented as a priority to be used by schedulers. MVCC Algorithms used here makes use of a specialized version of Serialization Graph, Called MultiVersion Serialization Graph(MVSG) to resolve data conflicts to maintain the serialization order among conflicting transactions. Using MVSG,MVCC algorithms can determine which lower priority transactions should be aborted to avoid deadlocks.