Dynamic transaction scheduling and reallocation in overloaded real-time database systems

We introduce a novel scheduling architecture with a new algorithm for dynamically resolving transient overloads, that is executed when a new transaction cannot be admitted to the system due to scarce resources. The resolver algorithm generates a cost effective overload resolution plan which, in order to admit the new transaction, finds the required time by de-allocating time among the previously admitted but not yet completed transactions. Considering the cost efficiency of executing the plan and the importance of the new transaction a decision is made whether to execute the plan and admit the new transaction, or to reject it. We consider a multi-class transaction workload consisting of hard critical and firm transactions, where critical transactions have contingency transactions that can be invoked during overloads. We present a performance analysis showing to what degree the overload resolver enforces predictability and ensures the timeliness of critical transactions when handling extreme overload scenarios in real-time database systems.

[1]  Miron Livny,et al.  Earliest deadline scheduling for real-time database systems , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[2]  Krithi Ramamritham,et al.  Meta-Level Control in Distributed Real-Time Systems , 1987, ICDCS.

[3]  Kang G. Shin,et al.  On Scheduling Tasks with a Quick Recovery from Failure , 1986, IEEE Transactions on Computers.

[4]  Abraham Silberschatz,et al.  Databases with Deadline and Contingency Constraints , 1995, IEEE Trans. Knowl. Data Eng..

[5]  Donald F. Towsley,et al.  Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes , 1991, VLDB.

[6]  Wayne P. Burleson,et al.  The spring scheduling co-processor: a scheduling accelerator , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[7]  Jörgen Hansson,et al.  Refining Timing Constraints of Applications in Deeds , 1997 .

[8]  Wei-Kuan Shih,et al.  Algorithms for scheduling imprecise computations , 1991, Computer.

[9]  Wei-Kuan Shih,et al.  On-line scheduling of imprecise computations to minimize error , 1992, [1992] Proceedings Real-Time Systems Symposium.

[10]  Donald F. Towsley,et al.  Experimental evaluation of real-time transaction processing , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[11]  Marco Spuri,et al.  Value vs. deadline scheduling in overload conditions , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[12]  Maryline Chetto,et al.  Some Results of the Earliest Deadline Scheduling Algorithm , 1989, IEEE Transactions on Software Engineering.

[13]  Prabhudev Konana,et al.  Multiclass Transaction Scheduling and Overload Management in Firm Real-Time Database Systems , 1996, Inf. Syst..

[14]  Jörgen Hansson,et al.  DeeDS towards a distributed and active real-time database system , 1996, SGMD.

[15]  Wei Kuan Shih,et al.  Fast algorithms for scheduling imprecise computations , 1989, RTSS 1989.

[16]  Sanjoy K. Baruah,et al.  On-line scheduling in the presence of overload , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  Sang Hyuk Son,et al.  Real-Time Database Systems: Issues and Applications , 1997 .

[18]  R. H. Campbell,et al.  A fault-tolerant scheduling problem , 1989, IEEE Transactions on Software Engineering.