Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T. P. Baker, “Stack-based scheduling of real-time processes”, Real-Time Systems Journal, 3(1):67–99, March 1991.
J. Hansson, Value-Driven Multi-Class Overload Management in Real-Time Database Systems, PhD thesis, Department of Computer Science, Linköping University, 1999.
J. Hansson, S. H. Son, J. A. Stankovic, and S. F. Andler, “Dynamic transaction scheduling and reallocation in overloaded real-time database systems”, in Proceedings of the 5th Conference on Real-Time Computing Systems and Applications (RTCSA’98), pages 293–302. IEEE Computer Press, 1998.
J. Huang, J. Stankovic, K. Ramamritham, and D. Towsley, “Experimental evaluation of real-time optimistic concurrency control schemes”, in Proceedings of the 17th International Conference on Very Large Data Bases, 1991.
J. W. S. Liu, K. J. Lin, W. K. Shih, A. C. Yu, J. Y. Chung, and W. Zhao, “Algorithms for scheduling imprecise computations”, in Andre’ van Tilborg and Gary M. Koob, editors, Foundations of Real-Time Computing. — Scheduling and Resource Management, chapter 8. Kluwer Academic Publishers, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
Hansson, J., Son, S.H. (2002). Overload Management in RTDBs. In: Lam, KY., Kuo, TW. (eds) Real-Time Database Systems. The International Series in Engineering and Computer Science, vol 593. Springer, Boston, MA. https://doi.org/10.1007/0-306-46988-X_10
Download citation
DOI: https://doi.org/10.1007/0-306-46988-X_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7218-9
Online ISBN: 978-0-306-46988-6
eBook Packages: Springer Book Archive