Question

Which of the following is more difficult than the scheduling independent task?

(a) scheduling algorithm

(b) scheduling independent task

(c) scheduling dependent task

(d) aperiodic scheduling algorithm

The question was asked in an international level competition.

This intriguing question comes from Periodic Scheduling topic in portion Embedded Operating System, Middleware and Scheduling of Embedded Systems

Answer 1

Right option is (c) scheduling dependent task

To elaborate: The scheduling dependent task is more difficult than the independent scheduling task. The problem of deciding whether or not a schedule exists for a given set of dependent tasks and a given deadline is NP-complete.