Abstract
Real-time databases are poised to be an important component of complex embedded real-time systems. In real-time databases (as opposed to real-time systems), transactions must satisfy the ACID properties in addition to satisfying the timing constraints specified for each transaction (or task). Although several approaches have been proposed to combine real-time scheduling and database concurrency control methods, to the best of our knowledge, none of them provide a framework for taking into account the dynamic cost associated with aborts, rollbacks, and restarts of transactions. In this paper, we propose a framework in which both static and dynamic costs of transactions can be taken into account. Specifically, we present: i) a method for pre-analyzing transactions based on the notion of branch-points for data accessed up to a branch point and predicting expected data access to be incurred for completing the transaction, ii) a formulation of cost that includes static and dynamic factors for prioritizing transactions, iii) a scheduling algorithm which uses the above two, and iv) simulation of the algorithm for several operating conditions and workload. Our dynamic priority assignment policy (termed the cost conscious approach or CCA) adapts well to fluctuations in the system load without causing excessive numbers of transaction restarts. Our simulations indicate that i) CCA performs better than the EDF-HP algorithm for both soft and firm deadlines, ii) CCA is more fair than EDF-HP, iii) CCA is better than EDF-CR for soft deadline, even though CCA requires and uses less information, and iv) CCA is especially good for disk-resident data.
Similar content being viewed by others
References
Abbott, R., and Garcia-Molina, H. 1988a. Scheduling real-time transactions. SIGMOD RECORD 17(1): 71–81.
Abbott, R., and Garcia-Molina, H. 1988b. Scheduling real-time transactions: A performance evaluation. Proceedings of the 14th VLDB, pp. 1–12. ACM.
Abbott, R., and Garcia-Molina, H. 1989. Scheduling real-time transactions with disk resident data. Proceedings of the 15th VLDB, pp. 385–396. ACM.
Abbott, R., and Garcia-Molina, H. 1992. Scheduling real-time transaction: Performance evaluation. ACM Transactions on Database Systems 17(3): 513–560.
Agrawal, R., Carey, M. J., and Livny, M. 1987. Concurrency control performance modeling: Alternatives and implications. ACM Transactions on Database Systems 12(4): 609–654.
Agrawal, R., and DeWitt, D. 1985. Integrated concurrency control and recovery mechanism: Design and performance evaluation. ACM Transactions on Database Systems 10(4): 529–564.
Bernstein, P. A., Hadzilacos, V., and Goodman, N. 1987. Concurrency Control and Recovery in Database Systems. Reading, MA: Addison-Wesley.
Buchmann, A., McCarthy, D. R., and Hsu, M. 1989. Time-critical database scheduling: A framework for integrating real-time scheduling and concurrency control. Proceedings of the Fifth Conference on Data Engineering, pp. 470–480.
Carey, M. J., Jauhari, R., and Livny, M. 1989. Priority in DBMS resource scheduling. Proceedings of the 15th VLDB.
Chakravarthy, S., et al. 1989. HiPAC: A research project in active, time-constrained database management (final report). Xerox Advanced Information Technology, Cambridge, MA, Technical Report XAIT–89–02.
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 3(3): 307–336.
Douglas, J. E., Douglass Locke, C., and Tokuda, H. 1985. A time-driven scheduler for real-time operating systems. Proceedings of the IEEE Real-Time Systems Symposium, pp. 112–122. IEEE.
Fishwick, P. A. 1992. SIMPACK:C-based Simulation Tool Package Version 2. University of Florida.
Gopinath, P., Bihari, T., and Gupta, R. 1991. Compiler techniques for generating predictable object-oriented real-time software. Proceedings of 9th IEEE Real-Time Operating Systems Workshop. IEEE.
Gopinath P., and Gupta, R. 1990. Applying compiler techniques to scheduling in real-time systems. Proceedings of the Real-Time Systems Symposium, pp. 247–256. IEEE.
Haritsa, J. R., Carey, M. J., and Livny, M. 1990. Dynamic real-time optimistic concurrency control. Proceedings of Real-Time System Symposium, Lake Buena Vista, Florida, pp. 94–103. IEEE.
Haritsa, J. R., Livny, M., and Carey, M. J. 1991. Earliest deadline scheduling for real-time database systems. Proceedings of Real-Time System Symposium, San Antonio, Texas, pp. 232–242. IEEE.
Hong, D., Johnson, T., and Chakravarthy, S. 1993. Real-time transaction scheduling: A cost-conscious approach. Proceedings of the 1993 ACM SIGMOD Int'l Conference on Management of Data, pp. 197–206. ACM.
Huang, J., Stankovic, J. A., Ramamritham, K., and Towsley, D. 1991. Experimental evaluation of real-time optimistic concurrency control schemes. Proceedings of the 17th VLDB, pp. 35–46. ACM.
Huang, J., Stankovic, J. A., Towsley, D., and Ramamritham, K. 1989. Experimental evaluation of real-time transaction processing. Proceedings of Real-Time Systems Symposium, pp. 144–153. IEEE.
Kim, W., and Srivastava, J. 1991. Enhancing real-time DBMS performance with multiversion data and priority based disk scheduling. Proceedings of Real-Time Systems Symposium, San Antonio, Texas, pp. 222–231. IEEE.
Lin, Y., and Son, S. H. 1990. Concurrency control in real-time databases by dynamic adjustment of serialization order. Proceedings of Real-Time Systems Symposium, Lake Buena Vista, Florida, pp. 104–112. IEEE.
Pang, H., Livny, M., and Carey, M. J. 1992. Transaction scheduling in multiclass real-time database systems. Proceedings of Real-Time System Symposium, Phoenix, Arizona, pp. 23–34. IEEE.
Ramamritham, K. 1993. Real-time databases. Distributed and Parallel Databases.
Sha, L. 1988. Concurrency control for distributed real-time databases. SIGMOD RECORD 17(1): 82–98.
Sha, L., Rajkumar, R., and Lehoczky, J. P. 1990. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers 39: 1175–1185.
Sha, L., Rajkumar, R., Son, S. H., and Chang, C.-H. 1991. A real-time locking protocol. IEEE Transactions on Computers 40(7): 793–800.
Stankovic, J. A., and Zhao, W. 1988. On real-time transactions. SIGMOD RECORD 17(1): 4–18.
Tay, Y. C. 1992. A behavioral analysis of scheduling by earliest deadline. Department of Mathematics, National University of Singapore, Technical Report No. 532.
Tay, Y. C., Suri, R., and Goodman, N. 1985. Locking performance in centralized databases. ACM Transactions on Database Systems 10(4): 415–462.
Xu, J., and Parnas, D. R. 1990. Scheduling processes with release times, deadlines, precedence, and exclusion relations. IEEE Transactions on Software Engineering 16(3): 360–369.
Zhao, W., Ramamritham, K., and JStankovic, J. A. 1987a. Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers 36(8): 949–960.
Zhao, W., Ramamritham, K., and Stankovic, J. A. 1987b. Scheduling tasks with requirement in hard real-time systems. IEEE Transactions on Software Engineering 13(5): 225–236.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chakravarthy, S., Hong, DK. & Johnson, T. Real-Time Transaction Scheduling: A Framework for Synthesizing Static and Dynamic Factors. Real-Time Systems 14, 135–170 (1998). https://doi.org/10.1023/A:1007960831894
Issue Date:
DOI: https://doi.org/10.1023/A:1007960831894