If you just needed to keep an ordered queue for each resource, things
would be easy. My example shows that when a process blocks on one
resource, it potentially must traverse the wait queues associated with
an arbitrary number of other resources.
> P0's priority is boosted to the priority of process 1. If process 2 then
> tries to take the lock *and* it's priority is higher than P1, P0's priority
> is boosted to the priority of P2. When P0 releases Lock 0, P0's priority is
> lowered to it's original priority. Now P2 has the lock and is higher
> priority than P1. When P2 releases the lock, P1 gets it.
I know how things work in the
simple case. The simple case is not the problem.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/