This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Quantification of Aborting Effect for Real-Time Data Accesses
May 2003 (vol. 52 no. 5)
pp. 670-675

Abstract—This paper proposes a generic framework to integrate real-time scheduling algorithms, conventional concurrency control algorithms, and aborting algorithms. The schedulability of a transaction system is improved by aborting excessive blocking from lower priority transactions. A schedulability analysis model is proposed to better manage the schedulability of a transaction system.

[1] R. Abbott and H. Garcia-Molina, “Scheduling Real-Time Transactions: A Performance Evaluation,” Proc. 14th Very Large Databases Conf., pp. 1-12, 1988.
[2] T.P. Baker, A Stack-Based Resource Allocation Policy for Real-Time Processes Proc. IEEE Real-Time Systems Symp., pp. 191-200, 1990.
[3] J.R. Haritsa, M.J. Carey, and M. Livny, “On Being Optimistic About Real-Time Constraints,” Proc. Ninth ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 331-343, Apr. 1990.
[4] T.-W. Kuo, M.-C. Liang, and L. Shu, “Abort-Oriented Concurrency Control for Real-Time Databases,” IEEE Trans. Computers, vol. 50, no. 7, pp. 660-673, July 2001.
[5] 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.
[6] M.-C. Liang, “Real-Time Database-Abort-Oriented Concurrency Control,” master thesis, Dept. of Computer Science and Information Eng., Nat'l Chung Cheng Univ., June 1996.
[7] M.-C. Liang, T.-W. Kuo, and L. Shu, “BAP: A Class of Abort-Oriented Protocols Based on the Notion of Compatibility,” Proc. Third Int'l Workshop Real-Time Computing Systems and Applications, pp. 118-127, Oct. 1996.
[8] 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.
[9] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[10] 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.
[11] A.K. Mok, “The Design of Real-Time Programming Systems Based on Process Models,” Proc. IEEE Real-Time System Symp., 1984.
[12] L. Sha, “Distributed Real-Time System Design Using Generalized Rate Monotonic Theory,” lecture note, Software Eng. Inst., Carnegie Mellon Univ. 1992.
[13] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Concurrency Control for Distributed Real-Time Databases,” ACM SIGMOD Record, vol. 17, pp. 82-98, Mar. 1988.
[14] 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.
[15] 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.
[16] L. Shu, M. Young, and R. Rajkumar, “An Abort Ceiling Protocol for Controlling Priority Inversion,” Proc. First Int'l Workshop Real-Time Computing Systems and Applications, pp. 202-206, Dec. 1994.
[17] 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.

Index Terms:
Real-time databases, concurrency control, priority inversion, transaction aborting, real-time data access.
Citation:
Ming-Chung Liang, Tei-Wei Kuo, LihChyun Shu, "A Quantification of Aborting Effect for Real-Time Data Accesses," IEEE Transactions on Computers, vol. 52, no. 5, pp. 670-675, May 2003, doi:10.1109/TC.2003.1197132
Usage of this product signifies your acceptance of the Terms of Use.