Abstract
A major challenge addressed by conventional database systems has been to efficiently implement the transaction model, which provides the properties of atomicity, serializability, and permanence. Real-time applications have added a complex new dimension to this challenge by placing deadlines on the response time of the database system. In this paper, we examine the problem of real-time data access scheduling, that is, the problem of scheduling the data accesses of real-time transactions in order to meet their deadlines. In particular, we focus on firm deadline real-time database applications, where transactions that miss their deadlines are discarded and the objective of the real-time database system is to minimize the number of missed deadlines. Within this framework, we use a detailed simulation model to compare the performance of several real-time locking protocols and optimistic concurrency control algorithms under a variety of real-time transaction workloads. The results of our study show that in moving from the conventional database system domain to the real-time domain, there are new performance-related forces that come into effect. Our experiments demonstrate that these factors can cause performance recommendations that were valid in a conventional database setting to be significantly altered in the corresponding real-time setting.
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, Proc. of 14th Intl. Conf. on Very Large DataBases. August.
Abbott, R., and Garcia-Molina, H. 1989. Scheduling real-time transactions with disk resident data, Proc of 15th Intl. Conf. on Very Large DataBases. August.
Agrawal, R., Carey, M., and Livny, M. 1987. Concurrency control performance modeling: alternatives and implications, ACM Trans. on Database Systems, 12(4), December.
Bernstein, P., Hadzilacos, V., and Goodman, N. 1987. Concurrency Control and Recovery in Database Systems, Reading, MA: Addison Wesley.
Carey, M. 1983. An abstract model of database concurrency control algorithms, Proc of ACM SIGMOD Intl. Conf. on Management of Data, May.
Carey, M., Krishnamurthi, S., and Livny, M. 1990. Load control for locking: the half-and-half algorithm, Proc of 9th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, April.
Cook, R., Son, R., Son, S., Oh, H., and Lee, J. 1991. New paradigms for real-time database systems, Proc of 8th IEEE Workshop on Real-Time Operating Systems and Software, May.
Eswaran, K., Gray, J., Lorie, R., and Traiger, I. 1976. The notions of consistency and predicate locks in a database system, Comm. of ACM, 19(11), November.
Franaszek, P., and Robinson, J. 1985. Limitations of concurrency in transaction processing, ACM Trans. on Database Systems, 12(1), March.
Gray, J., McJones, P., and Blasgen, M. 1981. The recovery manager of the System R database manager, ACM Computing Surveys, 13(2), June.
Haerder, T. 1984. Observations on optimistic concurrency control schemes, Information Systems, 9(2).
Haritsa, J., Carey, M., Livny, M. 1990(a). On being optimistic about real-time constraints, Proc. of 9th SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, April.
Haritsa, J., Carey, M., Livny, M. 1990(b). Dynamic real-time optimistic concurrency control, Proc. of 11th IEEE Real-Time Systems Symposium, December.
Haritsa, J. 1991. Transaction scheduling in firm real-time database systems, Ph.D. Thesis, Computer Sciences Dept., Univ. of Wisconsin, Madison.
Huang, J., Stankovic, J., Towsley, D., and Ramamritham, K. 1989. Experimental evaluation of real-time transaction processing, Proc. of 10th IEEE Real-Time Systems Symposium, December.
Huang, J., Stankovic, J., Ramamritham, K., and Towsley, D. 1991(a). Experimental evaluation of real-time optimistic concurrency control schemes, Proc. of 17th Intl. Conf. on Very Large Data Bases, September.
Huang, J., Stankovic, J., Ramamritham, K., and Towsley, D. 1991(b). On using priority inheritance in real-time databases, Proc. of 12th IEEE Real-Time Systems Symposium, December.
Kung, H., and Robinson, J. 1981. On optimistic methods for concurrency control, ACM Trans. on Database Systems, 6(2), June.
Lin, Y., and Son, S. 1990. Concurrency control in real-time database systems by dynamic adjustment of serialization order, Proc. of 11th IEEE Real-Time Systems Symposium, December.
Livny, M. 1988. DeNet User's Guide, Version 1.0, Computer Sciences Department, Univ. of Wisconsin, Madison.
Menasce, D., and Nakanishi, T. 1982. Optimistic versus pessimistic concurrency control mechanisms in database management systems, Information Systems, 7(1).
Ramamritham, K., and Stankovic, J. 1989. Overview of the SPRING project, IEEE Real-Time Systems Newsletter, Winter.
Robinson, J. 1982. Design of concurrency controls for transaction processing systems, Ph.D. Thesis, Computer Sciences Dept., Carnegie Mellon University.
Sha, L., Rajkumar, R., Lehoczky, J. 1987. Priority inheritance protocols: an approach to real-time synchronization, Technical Report CMU-CS-87-181, Depts. of CS, ECE, and Statistics, Carnegie Mellon University.
Stankovic, J., Zhao, W. 1988. On real-time transactions, ACM SIGMOD Record, 17(1), March.
Tay, Y. 1984. A mean value performance model for locking in databases, Ph.D. Thesis, Computer Sciences Dept., Harvard University, February.
Author information
Authors and Affiliations
Additional information
This work was done while the author was with the Computer Sciences Department, University of Wisconsin-Madison. This research was partially supported by the National Science Foundation under grant IRI-8657323.
Rights and permissions
About this article
Cite this article
Haritsa, J.R., Carey, M.J. & Livny, M. Data access scheduling in firm real-time database systems. The Journal of Real-Time Systems 4, 203–241 (1992). https://doi.org/10.1007/BF00365312
Issue Date:
DOI: https://doi.org/10.1007/BF00365312