Value vs. deadline scheduling in overload conditions
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 74, 90-99
- https://doi.org/10.1109/real.1995.495199
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Transient overloads in fault-tolerant real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The integration of deadline and criticalness in hard real-time schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- D/sup over/; an optimal on-line scheduling algorithm for overloaded real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On the competitiveness of on-line real-time task schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Earliest deadline scheduling for real-time database systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systemsReal-Time Systems, 1996
- Implications of classical scheduling results for real-time systemsComputer, 1995
- The Spring kernel: a new paradigm for real-time systemsIEEE Software, 1991
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959