Date: Fri, 19 May 2000 09:46:24 +0100 (BST) From: Doug Rabson <dfr@nlsystems.com> To: Wes Peters <wes@softweyr.com> Cc: Mike Smith <msmith@FreeBSD.ORG>, Chuck Paterson <cp@bsdi.com>, arch@FreeBSD.ORG Subject: Re: A new api for asynchronous task execution Message-ID: <Pine.BSF.4.21.0005190945150.73457-100000@salmon.nlsystems.com> In-Reply-To: <3924E16A.B1123749@softweyr.com>
next in thread | previous in thread | raw e-mail | index | archive | help
On Fri, 19 May 2000, Wes Peters wrote: > Mike Smith wrote: > > > > > > If you are talking about running processes in > > > > order based on scheduling priority, this is propagated > > > > though mutexs which have been blocked on. > > > > > > No, speaking of temporarily elevating the priority of a process holding > > > a lock to the highest priority of all processes blocking on the lock. > > > > You could call this "priority lending" so that the rest of us understand > > what you're talking about. 8) > > The only system I've ever worked on that implements them refer to > them as inversion-safe or inversion-proof semaphores. I've never seen > another name, including "priority lending", in any literature or > article on the subject. Anyway, whatever we choose to call it, the BSD/OS mutex does have support for priority lending. -- Doug Rabson Mail: dfr@nlsystems.com Nonlinear Systems Ltd. Phone: +44 20 8442 9037 To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-arch" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.BSF.4.21.0005190945150.73457-100000>