Research Article
Analysis of Real-Time Multi version Concurrency Control Algorithms using Serialisability Graphs
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 1 - Issue 21 |
| Published: February 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
@article{ 10.5120/54-648,
author = { K M Prakash Lingam },
title = { Analysis of Real-Time Multi version Concurrency Control Algorithms using Serialisability Graphs },
journal = { International Journal of Computer Applications },
year = { 2010 },
volume = { 1 },
number = { 21 },
pages = { 57-62 },
doi = { 10.5120/54-648 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2010
%A K M Prakash Lingam
%T Analysis of Real-Time Multi version Concurrency Control Algorithms using Serialisability Graphs%T
%J International Journal of Computer Applications
%V 1
%N 21
%P 57-62
%R 10.5120/54-648
%I Foundation of Computer Science (FCS), NY, USA
Abstract
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.
References
- Seok Hee Hong,Myoung Ho Kim, “A Real-Time Concurrency control algorithm:Use of Multiversion and Precedence Relationship,” taken from csd.ks.ac.kr/~shhong/sources/jsa.ps.gz
- P.A. Bernstein and N. Goodman, “Multiversion Concurrency Control-Theory and Algorithms,”ACM Trans. Database Systems, vol. 8, no. 4, pp. 465-483, Dec. 1983.
- R.Abbott, “Scheduling Real-Time Transactions:A performance Evaluation,” ACM Trans. Database Systems,Vol.17,no.3 , pp. 513-560, Sep.1992
- Elmasri,Navathe,undamentals Of Database Systems,” 3rd edition,pp.629-678,Addison –Wesley,1997
- P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987..
- “Multiversion concurrency control,”chapter 5 taken from research.microsoft.com/en-us/people/philbe/chapter5.pdf
- S.H.Son,Advances in Real-Time Systems,PHI,1995
- Quilong Han,Haiwei pan, A Concurrency Control Algorithm Access to Temporal Data in Real-Time Database Systems,” imsccs, pp.168-171, 2008 International Multi-symposiums on Computer and Computational Sciences, 2008
- Michael J. Carey and Waleed A. Muhanna. The performance of mul-tiversion concurrency control algorithms”. ACM Transactions on Com-puter Systems, 4(4):338{378, November 1986
Index Terms
Keywords