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

Discussion

A set of two tasks has a utilisation of 0.85. Under rate monotonic the set is

  • A.possibly schedulable, the bound for two tasks being 0.828
  • B.certainly schedulable, being below unity
  • C.certainly unschedulable, being above 0.693
  • D.schedulable only under earliest deadline first

Answer: A

Correct answer: possibly schedulable, the bound for two tasks being 0.828

\[ 2\left(2^{1/2}-1\right) = 0.828, \] and 0.85 exceeds it. The bound is sufficient but not necessary, so exceeding it proves nothing - the set may still meet every deadline, and response time analysis is needed to find out.

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

Post your comment

Please log in or register to post a comment.