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

Discussion

Adding a fifth task at 10 per cent to that set brings the utilisation to 0.90, at which point

  • A.no algorithm could meet the deadlines
  • B.rate monotonic would certainly meet the deadlines
  • C.the set becomes infeasible on any processor
  • D.earliest deadline first would still guarantee the deadlines

Answer: D

Correct answer: earliest deadline first would still guarantee the deadlines

Earliest deadline first is optimal on a single processor and meets every deadline for any set with utilisation at most one. At 0.90 the set is therefore guaranteed under it, while under rate monotonic it is well above the bound and would need response time analysis. This is the practical case for the dynamic algorithm.

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

Post your comment

Please log in or register to post a comment.