ON NONPREEMPTIVE SCHEDULING OF RECURRING TASKS USING INSERTED IDLE TIMES

We consider the problem of non-preemptively scheduling periodic and sporadic task systems on one processor using inserted idle times. For periodic task systems, we prove that the decision problem of determining whether a periodic task system is schedulable for all start times with respect to the class of algorithms using inserted idle times is NP-hard in the strong sense, even when the deadlines are equal to the periods. We then show that if there exists a polynomial time scheduling algorithm which correctly schedules a periodic task system T whenever T is feasible for all start times, then P = NP. We also prove that with respect to the same class of algorithms, the problem of determining whether there exist start times for which a periodic task system is feasible is also NP-hard in the strong sense even when the deadlines are equal to the periods. The second part of the paper concentrates on sporadic task systems and inserted idle times. It seems reasonable to suppose that to insert idle times properly, knowledge of future releases of tasks is required. Thus, inserted idle times should not be expected to have much use in scheduling sporadic task systems. We provide a for mal basis for these intuitions by proving that if a sporadic task system is schedulable by an online algorithm that uses inserted idle times, then it is schedulable by an online algorithm that does not use inserted idle times. We also prove that there cannot exist an optimal on-line inserted idle time algorithm for scheduling sporadic task systems, even if the deadlines correspond to the minimum separation time between successive releases of the same task. We conclude by considering the amount of look-ahead needed to schedule sporadic tasks correctly. (C) 1995 Academic Press, Inc.