in Operating System
477 views
0 votes
0 votes

A scheduler – such as an OS scheduler – can suffer from the priority inversion problem, in which a lower priority process indirectly pre-empts a higher priority process, and this can happen due to the usage of shared resources and mutual exclusion. Which of the solutions below can be used to deal with the priority inversion problem?

S1. If a process holds a shared resource, then assign it the highest priority.

S2. If a process holds a shared resource, then gradually increase its priority after certain intervals, so that it has the highest priority by the time it exits the CS.

  1. S1 alone
  2. S2 alone
  3. Neither S1 nor S2
  4. Either S1 or S2
in Operating System
by
477 views

Please log in or register to answer this question.

Related questions