A real-time parallel scheduler for the imprecise computation model
Hesham Y. Fouad, Bhagirath Narahari, James K. Hahn · 2001
. This paper considers the problem of scheduling hard real-time, periodic jobs on a multiprocessor while allowing imprecise computations. A highly dynamic job set is assumed, where limited a priori knowledge of a job set's behavior is available. The use of static partitioning schemes for such a job set is shown to lead to load imbalances and unecessary error. Instead, a dynamic load balancing approach is used. A set of constraints are established so that balancing the load does not invalidate established schedules or increase the error. Finally a scheduling algorithm, based on these constraints is presented. Key words. real-time systems, multiprocessors, scheduling algorithms, imprecise computations. AMS subject classifications. 68M20, 68N25, 68Q22 1. Introduction. The Imprecise Computation model [2] provides a framework for incorporating graceful degradation in real-time applications. The technique is based on the premise that, in some cases, producing less-that-perfect results on t...