Machine-translated by Google. Questions are authored in English.
Top

Discussion

Assigning every task the same priority in a preemptive kernel with time slicing gives behaviour like

  • A.a rate monotonic scheduler
  • B.an earliest deadline first scheduler
  • C.a cooperative kernel with no preemption
  • D.a round robin scheduler

Answer: D

Equal priorities and a slice is precisely round robin, and every task then waits for all the others before running again. It is easy to configure and throws away the whole benefit of the priority scheme, so it suits only sets with no timing requirements.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.