Performance of algorithms for scheduling real-time systems with overrun and overload
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper compares the performance of three classes of scheduling algorithms for real-time systems in which jobs may overrun their allocated processor time potentially causing the system to be overloaded. The first class, which contains classical priority scheduling algorithms as exem- plified by DM and EDF, provides a baseline. The second class is the Overrun Server Method which interrupts the ex- ecution of a job when it has used its allocated processor time and schedules the remaining portion as a request to an aperiodic server. The final class is the Isolation Server Method which executes each job as a request to an ape- riodic server to which it has been assigned. The perfor- mance of the Overrun Server and Isolation Server Methods are worse, in general, than the performance of the baseline algorithms on independent workloads. However, under the dependent workloads considered, the performance of the Isolation Server Method, using a server per task scheduled according to EDF, was significantly better than the perfor- mance of classical EDF.Keywords
This publication has 9 references indexed in Scilit:
- An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A scheme for scheduling hard real-time applications in open system environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Probabilistic performance guarantee for real-time tasks with varying computation timesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Aperiodic servers in a deadline scheduling environmentReal-Time Systems, 1995
- SMARTPublished by Association for Computing Machinery (ACM) ,1995
- Fixed priority scheduling with limited priority levelsIEEE Transactions on Computers, 1995
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973