Handling overload conditions
This chapter deals with the problem of scheduling real-time tasks in overload conditions; that is, in those critical situations in which the computational demand requested by the task set exceeds the time available on the processor, and hence not all tasks can complete within their deadlines.
KeywordsSchedule Algorithm Overload Condition Competitive Factor Relative Deadline Aperiodic Task
Unable to display preview. Download preview PDF.