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

Discussion

The processor utilisation of a task set is

  • A.the longest execution time divided by the shortest period
  • B.the number of tasks divided by the number of priority levels
  • C.the sum of each task's execution time divided by its period
  • D.the sum of the execution times of all the tasks

Answer: C

Correct answer: the sum of each task's execution time divided by its period

\[ U = \sum \frac{C_i}{T_i}. \] Each term is the fraction of the processor that task requires on average, and the sum is what the whole set demands. It is the first figure computed in any schedulability analysis, because a set demanding more than the processor has cannot be scheduled by any means whatever.

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

Post your comment

Please log in or register to post a comment.