Abstract

Preemptive scheduling a set of periodic tasks on multiprocessors is studied from the point of view of meeting their service requirements before given deadlines. Sufficient conditions permitting full utilization of the multiprocessor using the given scheduling algorithm are derived. Complexity of the scheduling algorithms including upper bounds on the number of preemptions are derived. Schemes (with little run-time cost) for on-line handling of tasks' arrival and exit are given. 1 Introduction Hard real-time systems are defined as those systems in which the correctness of the system depends not only on the logical result of computation, but also on the time at which the results are produced. Severe consequences will result if timing correctness properties of the system are violated. In other words, satisfying the timing requirements of hard real-time systems demand the scheduling of system resources according to some well understood algorithms, so that the system behaviour is predicta...

Citations