Question

Which of the scheduling algorithm are based on the assumption that tasks are executed until they are done?

(a) periodic task

(b) aperiodic task

(c) non-preemptive scheduling

(d) preemptive scheduling

The question was asked in unit test.

The question is from Classification of Scheduling Algorithms topic in division Embedded Operating System, Middleware and Scheduling of Embedded Systems

Answer 1

The correct answer is (c) non-preemptive scheduling

Explanation: The nonpreemptive scheduling is based on the assumptions that the tasks are executed until the task is done whereas the preemptive scheduling is used if the task has long execution times or for a short response time.