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

Discussion

Time slicing between tasks of equal priority is provided by a kernel to

  • A.reduce the number of context switches performed
  • B.guarantee the deadlines of the equal priority tasks
  • C.share the processor among equal tasks rather than let one monopolise it
  • D.raise the utilisation bound of the task set

Answer: C

Without it the first of several equal tasks to start would run until it blocked, which is sometimes wanted and often not. It guarantees nothing about deadlines: the wait grows with the number of equal tasks and the slice length.

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

Post your comment

Please log in or register to post a comment.