DocumentCode
2256990
Title
On-line scheduling to maximize task completions
Author
Baruah, Sanjoy K. ; Haritsa, Jayant ; Sharma, Nitin
Author_Institution
Vermont Univ., Burlington, VT, USA
fYear
1994
fDate
7-9 Dec 1994
Firstpage
228
Lastpage
236
Abstract
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
Keywords
performance evaluation; processor scheduling; real-time systems; safety-critical software; clairvoyant scheduler; deadlines; online scheduling; overload conditions; performance metric; task completions; uniprocessor scheduling; Real time systems; Scheduling; Software safety;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems Symposium, 1994., Proceedings.
Conference_Location
San Juan
Print_ISBN
0-8186-6600-5
Type
conf
DOI
10.1109/REAL.1994.342713
Filename
342713
Link To Document