Question #53582

Can you guarantee that a feasible schedule exists without a simulation of the schedule or time demand analysis, if

(a) The set of tasks T = {(5, 2),(8, 3),(10, 1)} is scheduled by the rate-monotonic algorithm.

(b) The set of tasks T = {(3, 1),(6, 1),(18, 6),(36, 4)} is scheduled by the least-slack-time-first algorithm.

(c) The set of tasks T = {(3, 1),(0, 6, 1, 4),(18, 6),(36, 4)} is scheduled by the earliest-deadline-first algorithm.

(d) The set of tasks T = {(3, 1),(6, 1),(18, 6),(36, 4)} is scheduled by the deadline-monotonic algorithm

(a) The set of tasks T = {(5, 2),(8, 3),(10, 1)} is scheduled by the rate-monotonic algorithm.

(b) The set of tasks T = {(3, 1),(6, 1),(18, 6),(36, 4)} is scheduled by the least-slack-time-first algorithm.

(c) The set of tasks T = {(3, 1),(0, 6, 1, 4),(18, 6),(36, 4)} is scheduled by the earliest-deadline-first algorithm.

(d) The set of tasks T = {(3, 1),(6, 1),(18, 6),(36, 4)} is scheduled by the deadline-monotonic algorithm

Expert's answer

## Comments

## Leave a comment