TaskPair-scheduling: an approach for dynamic real-time systems

In this paper an on-line scheduling approach called TaskPair-Scheduling is presented which merges the concepts of guaranteeing (an activity) and exception handling (due to time-outs) such that the guarantee may enclose the execution of the exception handler. An on-line scheduling algorithm is shown which plans guaranteed try-except constructs as a pair of tasks (MainTask, ExceptTask) by considering the ExceptTask as a hard real-time task (task of maximum importance) and the MainTask by its relative importance (this may depend on arbitrary criteria). This leads to timely predictable behaviour even if the MainTask of the activity has an arbitrary execution time. >