TY - GEN
T1 - On-line scheduling to maximize task completions
AU - Baruah, Sanjoy K.
AU - Haritsa, Jayant
AU - Sharma, Nitin
PY - 1994
Y1 - 1994
N2 - The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximize the number of tasks that complete by their deadlines. For this performance metric it is shown that, in general, any on-line algorithm may perform arbitrarily poorly as compared to a clairvoyant scheduler. Restricted instances of the general problem for which on-line schedulers ran provide a guaranteed level of performance are identified, and on-line algorithms presented for these special cases.
AB - The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximize the number of tasks that complete by their deadlines. For this performance metric it is shown that, in general, any on-line algorithm may perform arbitrarily poorly as compared to a clairvoyant scheduler. Restricted instances of the general problem for which on-line schedulers ran provide a guaranteed level of performance are identified, and on-line algorithms presented for these special cases.
UR - https://www.scopus.com/pages/publications/84882675597
U2 - 10.1109/REAL.1994.342713
DO - 10.1109/REAL.1994.342713
M3 - Conference contribution
AN - SCOPUS:84882675597
SN - 0818666005
SN - 9780818666001
T3 - Proceedings - Real-Time Systems Symposium
SP - 228
EP - 236
BT - Proceedings - Real-Time Systems Symposium, RTSS 1994
T2 - 15th IEEE Real-Time Systems Symposium, RTSS 1994
Y2 - 7 December 1994 through 9 December 1994
ER -