On the complexity of scheduling real-time tasks with self-suspensions on one processor

Integrating practical factors in scheduling theory is a major issue. Efficient schedulability tests (polynomial time or pseudo-polynomial time algorithms) are known for preemptive, independent tasks. In this paper, tasks are allowed to self-suspend. In practice, the real-time kernel suspends a task when it requests an external blocking operation. We study feasibility analysis problems from the computational complexity point of view. The problem is proved NP-hard in the strong sense for periodic, preemptive or non-preemptive task sets. If we allow tasks to have several flows of control (multi-threaded tasks), then the corresponding feasibility problem is shown to be NP-hard in the strong sense in the case of unit execution time threads.