MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  On-line scheduling to maximize task completions (1994) [16 citations — 1 self]

Download:
Download as a PDF | Download as a PS
by Sanjoy K. Baruah, Jayant R. Haritsa, Nitin Sharma
IEEE Real-time Systems Symposium
http://dsl.serc.iisc.ernet.in/pub/ccrtss94.ps
Add To MetaCart

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 can provide a guaranteed level of performance are identified, and on-line algorithms presented for these special cases. 1

Citations

7709 Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979
2168 Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment – Liu, Layland - 1973
150 Control robotics : the procedural control of physical processors – Dertouzos - 1974
125 ªOn Being Optimistic about Real-Time Constraints,º – Haritsa, Carey, et al. - 1990
124 A time-driven scheduling model for real-time operating systems – JENSEN, LOCKR, et al. - 1985
123 Earliest deadline scheduling for real-time database systems – Haritsa, Livny, et al.
92 D-Over: An Optimal On-Line Scheduling Algorithm for Overloaded Real-Time Systems – Koren, Shasha - 1992
79 On the competitiveness of on-line real-time task scheduling. Real-Time Systems – Baruah, Koren, et al. - 1992
63 On-line scheduling in the presence of overload – Baruah, Koren, et al. - 1991
56 A proof of the optimality of the shortest remaining processing time discipline – Schrage - 1968
44 An n job, one machine sequencing algorithm for minimizing the number of late jobs – Moore - 1968
25 Efficient on-line processor scheduling for a class of iris (increasing reward with increasing service.) real-time tasks – Dey, Kurose, et al. - 1993
6 ROBUST: A Hardware Solution to Real-Time Overload – Baruah, Haritsa - 1993
2 On Improved Performance Guarantees Through the Use of Slack Times – Baruah, Haritsa
View or Download | Add to My Collection | Correct Errors