- 论坛徽章:
- 14
|
Job H M L,优先级依次降低,即便引入了“优先级继承”,也可能会出现"优先级反转"的情况
下面是关于“优先级继承”的描述
In real-time computing, priority inheritance is a method for eliminating priority inversion. Using this programming method, a process scheduling algorithm increases the priority of a process (A) to the maximum priority of any other process waiting for any resource on which A has a resource lock.
也就是说,“优先级继承”产生的条件是:Job H已经被Job L block,此时赋予Job L 'H'的优先级,Job M则不会抢占Job L。
那么问题来了:
假设Job L只是持有了共享资源,但是Job H暂未被调度,Job M抢占Job L;Job H调度,想要抢占Job M变得不可能,只能block。
请问这种情况算是“优先级反转”吗? |
|