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

Discussion

The rate monotonic utilisation bound as the number of tasks grows without limit tends to

  • A.0.693
  • B.1.000
  • C.0.500
  • D.0.828

Answer: A

The limit of \( n(2^{1/n}-1) \) is the natural logarithm of two, about 0.693. It is the figure usually quoted as the rate monotonic bound, and it means a fixed priority system may have to leave nearly a third of the processor idle to be provably safe.

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

Post your comment

Please log in or register to post a comment.