Sciweavers

Share
RTSS
1994
IEEE

On-Line Scheduling to Maximize Task Completions

9 years 11 months ago
On-Line Scheduling to Maximize Task Completions
The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximzze the number of tasks that complete by their deadlines. For this performance metric it zs shown that, in general, any on-line algorithm may perform arbitrarily poorly as compared to a clairvoyant scheduler. Restricted znstances of the general problem for whzch on-line schedulers can provide a guaranteed level of performance are identijied, and on-line algorithms presented for these speczal cases.
Sanjoy K. Baruah, Jayant R. Haritsa, Nitin Sharma
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 1994
Where RTSS
Authors Sanjoy K. Baruah, Jayant R. Haritsa, Nitin Sharma
Comments (0)
books