Admission control for soft-deadline transactions in ACCORD

The use of admission control and overload management techniques in real-time systems has been shown to result in improved system performance-in terms of maximizing the value-added to the system by those transactions committing on time-in comparison to systems which do not employ such techniques. Continuing with our research in hard deadline Real-Time DataBase (RTDB) systems, we investigate the challenges associated with soft deadline transactions and describe a number of admission control and overload management techniques as well as scheduling algorithms appropriate for such systems.

[1]  Alan Burns,et al.  Flexible scheduling for adaptable real-time systems , 1995, Proceedings Real-Time Technology and Applications Symposium.

[2]  Daniel A. Menascé,et al.  Optimistic versus pessimistic concurrency control mechanisms in database management systems , 1982, Inf. Syst..

[3]  Jane W.-S. Liu,et al.  Scheduling Real-Time, Periodic Jobs Using Imprecise Results , 1987, RTSS.

[4]  Alan Burns,et al.  Mechanisms for enhancing the flexibility and utility of hard real-time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.

[5]  Hideyuki Tokuda,et al.  A Time-Driven Scheduling Model for Real-Time Operating Systems , 1985, RTSS.

[6]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

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

[8]  Wei-Pang Yang,et al.  Scheduling real-time transactions with dynamic values: a performance evaluation , 1995, Proceedings Second International Workshop on Real-Time Computing Systems and Applications.

[9]  Azer Bestavros,et al.  Value-cognizant admission control for RTDB systems , 1996, 17th IEEE Real-Time Systems Symposium.

[10]  Azer Bestavros,et al.  Value-cognizant Speculative Concurrency Control for Real-Time Databases , 1996, Inf. Syst..

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

[12]  Azer Bestavros,et al.  Value-cognizant Speculative Concurrency Control , 1995, VLDB.

[13]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.