Runtime feasibility check for non-preemptive real-time periodic tasks

摘要

In this paper we have proposed an algorithm for a scheduler to check, at runtime, the feasibility of a task set before scheduling a task in a non-EDF manner. And we have proved that a non-EDF scheduling using the proposed algorithm guarantees the timely execution of a feasible task set. The proposed algorithm can be useful for real-time systems to support a runtime task preference. It is also valid for systems running a sporadic task set and directly applicable to recent works for energy saving in non-preemptive real-time systems.