This Article 
 Bibliographic References 
 Add to: 
Concurrency Control for Mixed Transactions in Real-Time Databases
July 2002 (vol. 51 no. 7)
pp. 821-834

Many recent studies have suggested that the optimistic concurrency control (OCC) protocols outperform the locking-based protocols in real-time database systems (RTDBS). However, the OCC protocols suffer from the problem of unnecessary transaction restarts that is detrimental to transactions meeting their deadlines. The problem is more intensified in mixed transaction environments where both hard and firm real-time transactions exist. Firm transactions are more vulnerable to restarts when they are in conflict with hard transactions on data access. In this paper, we have addressed the problem and devised an effective OCC protocol with dynamic adjustment of serialization order (DASO), called OCC-DA, for RTDBS with mixed transactions. This protocol can avoid unnecessary transaction restarts by dynamically adjusting the serialization order of the conflicting transactions with respect to the validating transaction. As a result, much resource can be saved and more firm transactions can meet their deadlines without affecting the execution of hard transactions. The characteristics of the OCC-DA protocol have been examined in detail by simulation. The results show that the performance of the OCC-DA protocol is consistently better than the other two popular protocols, OCC with forward validation and OCC with Wait-50, over a wide range of system settings. In particular, the OCC-DA protocol provides a more significant performance gain in mixed transaction environments.

[1] R.K. Abbott and H. Garcia-Molina, “Scheduling Real-Time Transactions: A Performance Evaluation,” ACM Trans. Database Systems, vol. 17, no. 3, pp. 513–560, Sept. 1992.
[2] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[3] Real-Time Database Systems: Issues and Applications, A. Bestavros, K.J. Lin., and S.H. Son, eds. Kluwer Academic, 1997.
[4] A. Bestavros and V. Fay-Wolfe, Real-Time Database and Information Systems: Research Advances, Kluwer Academic, Boston, 1997.
[5] A. Datta, I.R. Viguier, S.H. Son, and V. Kumar, “A Study of Priority Cognizance in Conflict Resolution for Firm Real Time Database Systems,” Real-Time Database and Information Systems: Research Advances, pp. 167-180, Kluwer Academic, 1997.
[6] A. Datta, S.H. Son, and V. Kumar, “Is a Bird in the Hand Worth More than Two in the Bush? Limitations of Priority Cognizance in Conflict Resolution for Firm Real-Time Database Systems,” IEEE Trans. Computers, vol. 49, no. 5, pp. 482-502, May 2000.
[7] T Harder,“Observations on optimistic concurrency control schemes,” Information Systems, vol. 9, no. 2, pp. 111-120, 1984.
[8] J. Haritsa, M. Carey, and M. Livny, “Dynamic Real-Time Optimistic Concurrency Control,” Proc. 11th IEEE Real-Time Systems Symp., pp. 94-103, Dec. 1991.
[9] J. Haritsa, M. Livny, and M. Carey, “On Being Optimistic about Real-Time Constraints,” Proc. Ninth ACM Symp. Principles of Database Systems, 1990.
[10] M. Turk and A. Pentland, "Face Recognition Using Eigenfaces," Proc. IEEE Conf. on Computer Vision and Pattern Recognition, 1991, pp. 586-591.
[11] J. Huang, J. Stankovic, K. Ramamritham, and D. Towsley, “Experimental Evaluation of Real-Time Concurrency Control Schemes,” Proc. 17th Int'l Conf. Very Large Data Bases, 1991.
[12] J. Huang, J.A. Stankovic, K. Ramamritham, D. Towsley, and B. Purimetla, “On Using Priority Inheritance in Real-Time Databases,” Special Issue of Real-Time Systems J., vol. 4. no. 3, Sept. 1992.
[13] Concurrency Control Mechanisms in Centralized Database Systems, V. Kumar, ed. Prentice Hall, 1996.
[14] H.T. Kung and J.T. Robinson, "On Optimistic Methods for Concurrency Control," ACM Trans. Database Systems, vol. 6, no. 2, pp. 213-226, June 1981.
[15] T.W. Kuo and S.J. Ho, “Similarity-Based Load Adjustment for Static Real-Time Transaction Systems,” IEEE Trans. Computers, vol. 49, no. 2, pp. 112-126, Feb. 2000.
[16] T.W. Kuo and H.C. Hsih, “Concurrency Control in a Multiprocessor Real-Time Database System,” Proc. 12th Euromicro Conf. Real-Time Systems, pp. 55-62, 2000.
[17] K.W. Lam, K.Y. Lam, and S.L. Hung, “Real-Time Optimistic Concurrency Control Protocol with Dynamic Adjustment of Serialization Order,” Proc. IEEE Symp. Real-Time Technology and Applications, pp. 174-181, May 1995.
[18] K.W. Lam, S.H. Son, S.L. Hung, and Z. Wang, “Scheduling Transactions with Stringent Real-Time Constraints,” Information Systems, vol. 25, nos. 6-7, pp. 431-452, 2000.
[19] K.Y. Lam, “Concurrency Control in Distributed Real-Time Database Systems,” PhD thesis, Dept. of Computer Science, City Polytechnic of Hong Kong, 1994.
[20] J. Lee and S.H. Son, “An Optimistic Concurrency Control Protocol for Real-Time Database Systems,” Proc. Third Int'l Symp. Database Systems for Advanced Applications, 1993.
[21] J. Lee and S.H. Son, “Using Dynamic Adjustment of Serialization Order for Real-Time Database Systems,” Proc. IEEE Real-Time Systems Symp., Dec. 1993.
[22] J. Lee and S.H. Son, “Concurrency Control Algorithms for Real-Time Database Systems,” Performance of Concurrency Control Mechanisms in Centralized Database Systems, V. Kumar, ed., pp. 429–460, Prentice Hall, 1995.
[23] V.C.S. Lee, K.Y. Lam, and B. Kao, “Priority Scheduling of Transactions in Distributed Real-Time Databases,” Real-Time Systems, vol. 16, no. 1, pp. 31-62, 1999.
[24] C.-S. Peng and K.-J. Lin, “A Semantic-Based Concurrency Control Protocol for Real-Time Transactions,” Proc. IEEE 1996 Real-Time Technology and Applications Symp., 1996.
[25] K. Ramamritham,“Real-time databases,” Distributed and Parallel Databases, vol. 1, no. 2, Apr. 1993.
[26] L. Sha, R. Rajkumar, and J. Lehoczky, “Concurrency Control for Distributed Real-Time Databases,” ACM SIGMOD Record, vol. 17, 1988.
[27] L. Sha, R. Rajkuma, and J.P. Lehoczky, "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," IEEE Trans. Computers, vol. 39, no. 9, pp. 1,175-1,185, Sept. 1990.
[28] L. Sha, R. Rajkumar, S.H. Son, and C.H. Chang, “A Real-Time Locking Protocol,” IEEE Trans. Computers, vol. 40, no. 7, July 1991.
[29] S.H. Son and S. Kouloumbis, “A Token-Based Synchronization Scheme for Distributed Real-Time Databases,” Information Systems, vol. 18, no. 6, 1993.
[30] J.A. Stankovic, S. Son, and J. Hansson, “Misconceptions about Real-Time Databases,” IEEE Computer, vol. 32, no. 6, pp. 29-36, June 1999.
[31] O. Ulusoy, “Processing Real-Time Transactions in a Replicated Database System,” Technical Report BU-CEIS-94-13, Bilkent Univ., 1994.
[32] M. Xiong, K. Ramamritham, J. Haritsa, and J.A. Stankovic, “MIRROR: A State-Conscious Concurrency Control Protocol for Replicated Real-Time Databases,” Proc. Fifth IEEE Real-Time Technology and Applications Symp., pp. 100-110, 1999.
[33] P.S. Yu, K-L. Wu, K-J. Lin, and S.H. Son, “On Real-Time Databases: Concurrency Control and Scheduling,” Proc. IEEE, Special Issue on Real-Time Systems, vol. 82, no. 1, pp. 140-157, 1994.

Index Terms:
Real-time databases, optimistic concurrency control, serialization order adjustment, mixed transactions.
Victor C.S. Lee, Kwok-wa Lam, Sheung-Lun Hung, "Concurrency Control for Mixed Transactions in Real-Time Databases," IEEE Transactions on Computers, vol. 51, no. 7, pp. 821-834, July 2002, doi:10.1109/TC.2002.1017702
Usage of this product signifies your acceptance of the Terms of Use.