Handling overload conditions

Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 416)

Abstract

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.

Keywords

Schedule Algorithm Overload Condition Competitive Factor Relative Deadline Aperiodic Task 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1997

Personalised recommendations