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

Discussion

Earliest deadline first assigns the processor to the ready task with

  • A.the shortest period
  • B.the shortest remaining execution time
  • C.the largest laxity
  • D.the nearest absolute deadline

Answer: D

Correct answer: the nearest absolute deadline

Earliest deadline first is dynamic: the priority is recomputed at each release from the absolute deadline, so a task’s priority rises as its deadline approaches. That is what makes it optimal on one processor, meeting every deadline whenever the utilisation is at most unity.

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

Post your comment

Please log in or register to post a comment.