Scheduling real-time transactions

ABSTRACT

Scheduling transactions with real-time requirements presents many new problems. In this paper we discuss solutions for two of these problems: what is a reasonable method for modeling real-time constraints for database transactions? Traditional hard real-time constraints (e.g., deadlines) may be too limited. May transactions have soft deadlines and a more flexible model is needed to capture these soft time constraints. The second problem we address is scheduling. Time constraints add a new dimension to concurrency control. Not only must a schedule be serializable but it also should meet the time constraints of all the transactions in the schedule.

REFERENCES

• 1: C. J. Date, An introduction to database systems: vol. I (4th ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
• 2: Islo80. Isloor, Sreekaanth S. and T. Anthony Marsland, "The Deadlock Problem: An Overview," IEEE Computer, pp. 58-78, IEEE, September, 1980.
• 3: Jens86. Jensen, E. Douglas, C. Douglass Locke, and Hideyuki Tokuda, "A time-driven scheduler for real-time operating systems," Proceedings IEEE Real-time Systems Symposium, pp. 112-122, IEEE, 1986.
• 4: Voel87. Voelcker, John, "How Computers Helped Stampede the Stock Market," IEEE Spectrum, vol. 24, pp. 30-33, IEEE, December 1987.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sequencing and scheduling

Additional Classification:
  C. Computer Systems Organization
  C.3 SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS
      Subjects: Real-time and embedded systems

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Transaction processing; Concurrency

General Terms:
Algorithms, Design, Management, Theory