This Article 
 Bibliographic References 
 Add to: 
Abort-Oriented Concurrency Control for Real-Time Databases
July 2001 (vol. 50 no. 7)
pp. 660-673

Abstract—There has been growing interest in the performance of transaction systems that have significant response time requirements. These requirements are usually specified as hard or soft deadlines on individual transactions and a concurrency control algorithm must attempt to meet the deadlines as well as preserve data consistency. This paper proposes a class of simple and efficient abort-oriented concurrency control algorithms in which the schedulability of a transaction system is improved by aborting transactions that introduce excessive blockings. We consider different levels of the aborting relationship among transactions and evaluate the impacts of the aborting relationship when the relationship is built in an online or offline fashion. We measure aborting overheads on a system running the LynxOS real time operating system. The strengths of the work are demonstrated by improving the worst-case schedulability of an avionics example [20], a satellite control system [7], and randomly generated transaction sets.

[1] “LynxOS Frequently Asked Questions,” http:/, year?
[2] “LynxOS Real-Time Performance Analysis,” , year?
[3] R. Abbott and H. Garcia-Molina,“Scheduling real-time transactions: A performance evaluation,” Proc. 14th Int’l Conf. Very Large Data Bases, Aug. 1988.
[4] A. Bestavros and S. Braoudakis, “Timeliness via Speculation for Real-Time Databases,” Proc. IEEE Real-Time Systems Symp., Dec. 1994.
[5] A. Bestavros, “Advances in Real-Time Database Systems Research,” Special Section on RTDB of ACM SIGMOD Record, vol. 25, no. 1, Mar. 1996.
[6] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[7] A. Burns, A.J. Wellings, C.M. Bailey, and E. Fyfe, “A Case Study in Hard Real-Time System Design and Implementation,” YCS 190, Dept. of Computer Science, Univ. of York, 1993.
[8] L.B.C. Dipippo and V.F. Wolfe, “Object-Based Semantic Real-Time Concurrency Control,” Proc. IEEE Real-Time Systems Symp., Dec. 1993.
[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.U. Kamath and K. Ramamritham, “Performance Characteristics of Epsilon Serializability with Hierarchical Inconsistency Bounds,” Proc. Int'l Conf. Data Eng., pp. 587-594, Apr. 1993.
[11] Y.-K. Kim and S.H. Son, “Supporting Predictability in Real-Time Database Systems,” Proc. IEEE 1996 Real-Time Technology and Applications Symp., 1996.
[12] T.-W. Kuo and A.K. Mok, “SSP: A Semantics-Based Protocol for Real-Time Data Access,” Proc. IEEE 14th Real-Time Systems Symp., Dec. 1993.
[13] K-W. Lam and S.L. Hung, “A Preemptive Transaction Scheduling Protocol for Controlling Priority Inversion,” Proc. Third Int'l Workshop Real-Time Computing Systems and Applications, Oct. 1996.
[14] K.-W. Lam, S.H. Son, V.C.S. Lee, and S.L. Hung, “Using Separate Algorithms to Process Read-Only Transactions in Real-Time Systems,” Proc. IEEE 19th Real-Time Systems Symp., Dec. 1998.
[15] S.J. Leffler, M.K. McKusick, M.J. Karels, and J.S. Quarterman, The Design and Implementation of the 4.3BSD UNIX Operating System. Reading, Mass.: Addison-Wesley, 1989.
[16] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[17] M.-C. Liang, T.-W. Kuo, and L. Shu, “A Quantification of Aborting Effect for Real-Time Data Accesses,” IEEE Trans. Computers, to appear.
[18] J. Lehoczky, L. Sha, and Y. Ding, The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior Proc. IEEE Real-Time Systems Symp., pp. 166-171, 1989.
[19] Y. Lin and S.H. Son, “Concurrency Control in Real-Time Databases by Dynamic Adjustment of Serialization Order,” Proc. IEEE 11th Real-Time Systems Symp., Dec. 1990.
[20] C.D. Locke, D.R. Vogel, and T.J. Mesler, “Building a Predictable Avionics Platform in Ada: A Case Study,” Proc. IEEE 12th Real-Time Systems Symp., Dec. 1991.
[21] 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.
[22] L. Sha, “Distributed Real-Time System Design Using Generalized Rate Monotonic Theory,” lecture note, Software Eng. Inst., Carnegie-Mellon Univ., 1992.
[23] L. Shu and M. Young, “A Mixed Locking/Abort Protocol for Hard Real-TimeSystems,” Proc. IEEE 11th Workshop Real-Time Operating Systems and Software, pp. 102-106, May 1994.
[24] L. Shu, M. Young, and R. Rajkumar, “An Abort Ceiling Protocol for Controling Priority Inversion,” Proc. First Int'l Workshop Real-Time Computing Systems and Applications, pp. 202-206, Dec. 1994.
[25] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronization,” Technical Report CMU-CS-87-181, Dept. of Computer Science, Carnegie-Mellon Univ., Nov. 1987, IEEE Trans. Computers, vol. 39, no. 9, Sept. 1990.
[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. Rajkumar, S.H. Son, and C.H. Chang, “A Real-Time Locking Protocol,” IEEE Trans. Computers, vol. 40, no. 7, July 1991.
[28] H. Takada and K. Sakamura, “Real-Time Synchronization Protocols for Controlling Priority Inversion,” Proc. First Int'l Workshop Real-Time Computing Systems and Applications, pp. 202-206, Dec. 1994.
[29] M. Xiong, R.M. Sivasankaran, J. Stankovic, K. Ramamritham, and D. Towsley, “Scheduling Transactions with Temporal Constraints: Exploiting Data Semantics,” Proc. IEEE 17th Real-Time Systems Symp., pp. 240-251, Dec. 1996.

Index Terms:
Real-time databases, concurrency control, transaction aborting, priority inversion.
Tei-Wei Kuo, Ming-Chung Liang, LihChyun Shu, "Abort-Oriented Concurrency Control for Real-Time Databases," IEEE Transactions on Computers, vol. 50, no. 7, pp. 660-673, July 2001, doi:10.1109/12.936233
Usage of this product signifies your acceptance of the Terms of Use.