How priority propagation works on read/write lock?

[rookie]

2006/1/18, Daniel Eischen <deischen at freebsd.org>:
>You will eventually do priority propagation for all of them
> (A, B, and C) until G's priority is <= the priority of RW1.
> It doesn't matter if you do one at a time or all of them
> at once.  They all (A, B, C) have to release RW1 before
> G can run

You don't point out the problem.
Here the problem is propagating priority to D, {E1, E2, E3} and F. If it
doesn't happen the whole system will starve.

Cheers,
Attilio

--
Peace can only be achieved by understanding - A. Einstein