Abstract
Due to resource sharing among tasks, priority inversion can occur during priority-driven preemptive scheduling. In this work, we investigate solutions to the priority inversion problem in a soft real-time database environment where two-phhse locking is employed for concurrency control. We examine two basic schemes for addressing the priority inversion problem, one based on priority inheritance and the other based on priority abort. We also study a new scheme, called conditional priority inheritance, which attempts to capitalize on the advantages of each of the two basic schemes. In contrast with previous results obtained in real-time operating systems, our performance studies, conducted on an actual real-time database testbed, indicate that the basic priority inheritance protocol is inappropriate for solving the priority inversion problem in real-time database systems. We identify the reasons for this performance. We also show that the conditional priority inheritance scheme and the priority abort scheme perform well for a wide range of system workloads.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abbott, R., and Garcia-Molina, H. 1988. Scheduling real-time transactions: a performance evaluation, Proceedings of the 14th VLDB Conference. August.
Chen, M. and K. Lin 1990. Dynamic priority ceilings: A concurrency control protocol for real-time systems, Real-Time Systems, vol. 2, (4), December.
Chen, S., Stankovic, J., Kurose, J., and Towsley, D. 1991. Performance evaluation of two new disk scheduling algorithms for real-time systems, Real-Time Systems, vol. 3 (3), September.
Haritsa, J., Carey, M.J., Livny, M. 1990. Dynamic real-time optimistic concurrency control, Proceedings of the 11th Real-Time Systems Symposium, December.
Huang, J., Stankovic, J.A., Towsley, D., and Ramamritham, K. 1989. Experimental evaluation of real-time transaction processing, Proceedings of the 10th Real-Time Systems Symposium, December.
Huang, J. and Stankovic, J.A. 1990. Concurrency in real-time database systems: optimistic scheme vs. two-phase locking approach, A Technical Report, COINS 90-66, University of Massachusetts, July.
Huang, J., Stankovic, J., Ramamritham, K., and Towsley, D. 1991. Experimental evaluation of real-time optimistic concurrency control schemes, Proceedings of the 17th VLDB Conference, September.
Rajkumar, R. 1989. Task Synchronization in real-time systems, Ph.D. Dissertation, Dept. of Electrical and Computer Engineering, Carnegie-Mellon University.
Sha, L., Rajkumar, R., Lehoczky, J. 1987. Priority inheritance protocols: an approach to real-time synchronization, Technical Report, Computer Sciences Dept., Carnegie-Mellon University.
Sha, L., Rajkumar, R., Lehoczky, J. 1988. Concurrency control for distributed real-time databases, ACM SIGMOD Record, March.
Son, S.H. and Chang, C. 1990. Performance evaluation of real-time locking protocols using a distributed software prototyping environment, Proceedings of the 10th International Conference on Distributed Computing Systems, May.
Author information
Authors and Affiliations
Additional information
This work was supported by the National Science Foundation under Grant IRI-8908693 and by the U.S. Office of Naval Research under Grant N00014-85-K0398.
A previous version of this paper appeared in Real-Time Systems Symposium, Dec. 1991.
Rights and permissions
About this article
Cite this article
Huang, J., Stankovic, J.A., Ramamritham, K. et al. Priority inheritance in soft real-time databases. The Journal of Real-Time Systems 4, 243–278 (1992). https://doi.org/10.1007/BF00365313
Issue Date:
DOI: https://doi.org/10.1007/BF00365313