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

Discussion

The blocking a high priority task suffers under the priority ceiling protocol is bounded by

  • A.the length of the kernel's system tick
  • B.the longest single critical section of any lower priority task using the resource
  • C.the sum of every critical section in the system
  • D.the period of the lowest priority task

Answer: B

The protocol permits at most one such blocking per release, which is what makes the bound so attractive: the analysis adds a single term rather than a sum. Plain inheritance can in the worst case block a task once for each resource it needs.

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

Post your comment

Please log in or register to post a comment.