Date: Wed, 18 Jan 2006 16:15:40 +0100 From: rookie <asmrookie@gmail.com> To: Daniel Eischen <deischen@freebsd.org> Cc: freebsd-hackers@freebsd.org Subject: Re: How priority propagation works on read/write lock? Message-ID: <3bbf2fe10601180715k25297666y@mail.gmail.com> In-Reply-To: <Pine.GSO.4.43.0601180919520.18135-100000@sea.ntplx.net> References: <3bbf2fe10601180138m3a5ab67cx@mail.gmail.com> <Pine.GSO.4.43.0601180919520.18135-100000@sea.ntplx.net>
next in thread | previous in thread | raw e-mail | index | archive | help
2006/1/18, Daniel Eischen <deischen@freebsd.org>:
>You will eventually do priority propagation for all of them
> (A, B, and C) until G's priority is <=3D 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
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?3bbf2fe10601180715k25297666y>