Abstract
Real-time database systems have transactions with explicit timing constraints, such as ready time, deadlines, and temporal constraints. Meeting the requirements of real-time database systems (RTDBS) requires a balanced and coordinated effort between concurrency control and transaction scheduling. Current research efforts in RTDBS have been focused on scheduling transactions with soft or firm deadlines with serializability as the sole correctness criterion. Efficient resource scheduling algorithms and concurrency control protocols are required to schedule so as to satisfy both timing and data consistency requirements. What we need is a concurrency control algorithm that allows transactions to meet the timing constraints as much as possible without reducing the concurrency level of the system in the absence of any a priori information. In this paper, we present new real-time transaction scheduling algorithms which employ a hybrid approach, i.e., a combination of locking, pessimistic and optimistic methods. Our experimental results indicate that proposed protocols appears to be good, especially under conditions of high transaction load and high data contention.
Keywords
Preview
Unable to display preview. Download preview PDF.
References
N. Lynch, M. Merritt, W. Weihl: Atomic Transactions, Morgan Kaufmann Publishers, San Mateo, California, 1994.
J. Gray, A. Reuter: Transaction Processing — Concepts and Techniques, Morgan Kaufmann Publishers, San Mateo, California, 1993.
E. Jensen, C. Locke, H. Tokuda: A Time-Driven Scheduling Model for Real-Time Operating Systems, Proc. of the 6th IEEE Real-Time Systems Symposium (RTSS), December 1985.
M. Singhal: Issues and Approaches to Design of Real-Time Database Systems, ACM SIGMOD Record, March 1988.
C. Boksenbaum, M. Cart, J. Ferrie, and J. Pons: Concurrent Certifications by Intervals of Timestamps in Distributed Database Systems, IEEE Transactions on Software Engineering, Vol. SE-13, 1987.
X. Song, J. Liu: How Well Can Data Temporal Consistency be Maintained?, Proceedings of IEEE Symposium on Computer-Aided Control System Design, 1992.
J. Lehoczky, L. Sha: Performance of Real-Time Scheduling Algorithms. ACM Performance Review, Special Issue Vol. 14, 1986.
J. Leung, L. Merrill: A Note on Preemptive Scheduling of Periodic, Real-Time Tasks. Information Processing Letters 11, 1980.
L. Liu, W. Layland: Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. JACM, 1973.
W. Zhao, K. Ramamritham, J. Stankovic: Preemptive Scheduling Under Time and Resource Constraints. IEEE Transactions on Computers, 1987.
W. Zhao, K. Ramamritham, A. Stankovic: Scheduling Tasks with Resource Requirements in Hard Real-Time Systems. IEEE Transactions on Software Engineering, May 1987.
K. Ramamritham, A. Stankovic: Dynamic Task Scheduling in Hard Real-Time Distributed Systems. IEEE Software, July 1984.
J. Stankovic: Misconception about Real-Time Computing. Computer, Oct., 1988.
L. Sha, R. Rajkumar, C. Chang: A Real-Time Locking Protocol. IEEE Trans. On Computers, July 1991.
J. R. Haritsa, M. J. Carey, M. Livny: On being optimistic about real-time constraints. ACM SIGACT-SIGMOD-SIGART, 1990.
J. R. Haritsa, M. J. Carey, M. Livny: Data access scheduling in firm real-time database systems. Real-Time Syst., 1992.
J. H. Haritsa, M. J. Carey, M. Livny: Dynamic real-time optimistic concurrency control. Proc. 11th Real-Time Systems Symp., 1990.
S. H. Son, C. H. Chang: Performance evaluation of real-time locking protocols using a distributed software prototyping environment. Proc. 10th Int. Conf. On Distributed Computing Systems, 1990.
Y. Lin, S. H. Son: Concurrency control in real-time databases by dynamic adjustment of serialization order. Proc. 11th Real-Time Syst., 1990.
H. F. Korth, A. Silberschatz, Database System Concepts, McGraw Hill, 1986.
C. H. Papdimitriou: The Theory of Database Concurrency Control. Computer Science Press, 1986.
J. R. Haritsa, M. J. Carey, M. Livny: Dynamic Real-Time Optimistic Concurrency Control, IEEE Real-Time Systems Symposium, Orlando, Florida, 1990.
J. Huang, J. A. Stankovic, K. Ramamritham, D. Towsley: Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes, VLDB Conference, Barcelona, Spain, 1991.
L. Sha, R. Rajkumar: A real-time locking protocol. IEEE Trans. Comput. 40, 1991.
J. R. Haritsa, M. J. Carey, M. Livny: Dynamic Real-Time Optimistic Concurrency Control, IEEE Real-Time Systems Symposium, Florida, December 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wietrzyk, V.I., Ramaswamy, V. (1996). Real-time transaction scheduling in database systems. In: Wagner, R.R., Thoma, H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034717
Download citation
DOI: https://doi.org/10.1007/BFb0034717
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61656-6
Online ISBN: 978-3-540-70651-9
eBook Packages: Springer Book Archive