Throwforward task scheduling strategy in real time systems

In this paper we consider the problem of scheduling hard real time tasks on a set of identical processors. Tasks are assumed to arrive for service at previously unknown points of time at the system. A decision has to be made whether a new task is rejected or accepted for processing. Once a task is accepted the scheduling policy assures that the task will be processed on time.<
>