Advertisement

Admission Control and Overload Management for Real-Time Databases

  • Azer Bestavros
  • Sue Nagy
Chapter
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 396)

Abstract

Admission control and overload management techniques are central to the design and implementation of Real-Time Database Systems. In this chapter, we motivate the need for these mechanisms and we present previous and current research work aimed at adding such capabilities to Real-Time Databases.

Keywords

Arrival Rate Admission Control Primary Task Concurrency Control Early Deadline First 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions. ACM, SIGMOD Record, 17(1):71–81, 1988.CrossRefGoogle Scholar
  2. [2]
    Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions: A performance evaluation. In Proceedings of the 14th International Conference on Very Large Data Bases, pages 1–12, Los Angeles, Ca, 1988.Google Scholar
  3. [3]
    Azer Bestavros and Spyridon Braoudakis. Timeliness via speculation for real-time databases. In Proceedings of RTSS′94: The 14th IEEE Real-Time System Symposium, San Juan, Puerto Rico, December 1994.Google Scholar
  4. [4]
    Azer Bestavros and Spyridon Braoudakis. Value-cognizant speculative concurrency control. In Proceedings of VLDB′95: The International Conference on Very Large Databases, Zurich, Switzerland, Spetember 1995.Google Scholar
  5. [5]
    Azer Bestavros and Sue Nagy. Value-cognizant admission control for rtdbs. In Proceedings of RTSS′96: The 16 th IEEE Real-Time System Symposium, Washington, DC, December 1996.Google Scholar
  6. [6]
    Sara Biyabani, John Stankovic, and Krithi Ramamritham. The integration of deadline and criticalness in hard real-time scheduling. In Proceedings of the 9th Real-Time Systems Symposium, December 1988.Google Scholar
  7. [7]
    Spyridon Braoudakis. Concurrency Control Protocols for Real-Time Databases. PhD thesis, Computer Science Department, Boston University, Boston, MA 02215, November 1994.Google Scholar
  8. [8]
    G. Buttazzo, M. Spuri, and F. Sensini. Value vs. deadline scheduling in overload conditions. In Proceedings of the 16th Real-Time Systems Symposium, December 1995.Google Scholar
  9. [9]
    S. Chakravarthy, D. Hong, and T. Johnson. Incorporating load factor into the scheduling of soft real-time transactions. Technical Report TR94-024, University of Florida, Department of Computer and Information Science, 1994.Google Scholar
  10. [10]
    H. Chetto and M. Chetto. Some results of the earliest deadline scheduling algorithm. IEEE Transactions on Software Engineering, 15(10):1261–1269, October 1989.MathSciNetCrossRefGoogle Scholar
  11. [11]
    M. L. Dertouzos. Control robotics: The procedural control of physical processes. In Proceedings IFIP Congress, pages 807–813, 1974.Google Scholar
  12. [12]
    B. Goyal, J. Haritsa, S. Seshadri, and V. Srinivasan. Index concurrency control in firm real-time dbms. In Proceedings of the 21st VLDB Conference, pages 146–157, September 1995.Google Scholar
  13. [13]
    Jayant R. Haritsa, Michael J. Carey, and Miron Livny. On being optimistic about real-time constraints. In Proceedings of the 1990 ACM PODS Symposium, April 1990.Google Scholar
  14. [14]
    Jayant R. Haritsa, Miron Livny, and Michael J. Carey. Earliest deadline scheduling for real-time database systems. In Proceedings of the 12th Real-Time Systems Symposium, December 1991.Google Scholar
  15. [15]
    J. Huang, J. A. Stankovic, D. Towsley, and K. Ramamritham. Experimental evaluation of real-time transaction processing. In Proceedings of the 10th Real-Time Systems. Symposium, December 1989.Google Scholar
  16. [16]
    E.D. Jensen, C.D. Locke, and J. Tokuda. A time-driven scheduling model for real-time operating systems. In Proceedings of the 6th Real-Time Systems Symposium, pages 112–122, December 1985.Google Scholar
  17. [17]
    Lee W. Johnson and R. Dean Riess. Numerical Analysis. Addison Wesley, 1982.Google Scholar
  18. [18]
    Young-Kuk Kim. Predictability and Consistency in Real-Time Transaction Processing. PhD thesis, Department of Computer Science, University of Virginia, May 1995.Google Scholar
  19. [19]
    C. M. Krishna and K. G. Shin. On scheduling tasks with a quick recovery from failure. IEEE Transactions on Computers, 35(5):448–455, May 1986.zbMATHCrossRefGoogle Scholar
  20. [20]
    A. Liestman and R. Campbell. A fault-tolerant scheduling problem. IEEE Transaction on Software Engineering, SE-12(11):1089–1095, November 1986.Google Scholar
  21. [21]
    K. J. Lin, S. Natarajan, and J. W.-S. Liu. Imprecise results: Utilizing partial commputations in real-time systems. In Proceedings of the 8th IEEE Real-Time Systems Symposium, December 1987.Google Scholar
  22. [22]
    C. L. Liu and J. Layland. Scheduling algorithms for multiprogramming in hard real-time environments. Journal of the Assocation of Computing Machinery, 20(1):46–61, January 1973.MathSciNetzbMATHCrossRefGoogle Scholar
  23. [23]
    J. W.-S. Liu, K. J. Lin, and S. Natarajan. Scheduling real-time, periodic jobs using imprecise results. In Proceedings of the 8th IEEE Real-time Systems Symposium, December 1987.Google Scholar
  24. [24]
    C. Locke. Best Effort Decision Making for Real-Time Scheduling. PhD thesis, Carnegie-Mellon University, Department of Computer Science, May 1986.Google Scholar
  25. [25]
    D. Menasce and T. Nakanishi. Optimistic versus pessimistic concurrency control mechanisms in database management systems. Information Systems, 7(1), 1982.Google Scholar
  26. [26]
    D. Mosse, R. Melhem, and S. Ghosh. Analysis of a fault-tolerant multiprocessor scheduling algorithm. IEEE Fault Tolerant Computing, pages 16–25, 1994.Google Scholar
  27. [27]
    Y. Oh and S. Son. An algorithm for real-time fault-tolerant scheduling in multiprocessor systems. In Fourth Euromicro Workshop on Real-time Systems, 1992.Google Scholar
  28. [28]
    H. Pang, M. J. Carey, and M. Livny. Managing memory for real-time queries. In Proceedings of the 1994 ACM SIGMOD Conference on Management of Data, pages 221–232, 1994.Google Scholar
  29. [29]
    Krithi Ramamritham. Real-time databases. International journal of Distributed and Parallel Databases, 1(2), 1993.Google Scholar
  30. [30]
    John Stankovic and Wei Zhao. On real-time transactions. ACM, SIGMOD Record, 17(1):4–18, 1988.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Azer Bestavros
    • 1
  • Sue Nagy
    • 1
  1. 1.Computer Science DepartmentBoston UniversityBostonUSA

Personalised recommendations