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

Discussion

Five periodic tasks together demand seventy per cent of the processor. Applying the fixed priority bound test to them shows the set to be

  • A.certainly schedulable, 0.70 being below the five-task bound of 0.743
  • B.possibly schedulable, 0.70 exceeding the five-task bound
  • C.certainly unschedulable, 0.70 exceeding 0.693
  • D.schedulable only under earliest deadline first

Answer: A

Substituting five into the formula gives 0.743, and being below it is a sufficient condition, so no further analysis is needed. The limiting figure of 0.693 applies only as the number of tasks grows without bound and is always pessimistic for a finite set.

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

Post your comment

Please log in or register to post a comment.