1993 · 58 citations · 0 references
ComputingComputer EngineeringComputer SystemsFault-tolerant SystemsReal-time SystemsSchedulingDeadline AnalysisDynamic SchedulingReal-time Resource ManagementReal-time SchedulingReal-time Systems DesignSchedulability AnalysisDeadline GuaranteesDynamic Re-schedulingOverload ManagementOverload OperationPeriodic Task SchedulingReal-time Task SchedulingSporadic Task ModelSufficient Schedulability Conditions
In this paper we introduce a robust earlist deadline scheduling algorithm for dealing with sporadic tasks under overloads in a hard real-time environment. The algorithm synergestically combines many features including a very important minimum level of guarantee, dynamic guarantees, graceful degredation in overloads, deadline tolerance, resource reclaiming, and dynamic re-guarantees. A necessary and sufficient schedulability test is presented, and an efficient 0(n) guarantee algorithm is proposed. The new algorithm is evaluated via simulation and compared to several baseline algorithms. The experimental results show excellant performance of the new algorithm in normal and overload conditions.