Date: Mon, 26 Jun 2000 12:46:30 -0400 (EDT) From: Luoqi Chen <luoqi@watermarkgroup.com> To: jasone@canonware.com, smp@FreeBSD.ORG Subject: Re: SMP meeting summary Message-ID: <200006261646.e5QGkUS06290@lor.watermarkgroup.com>
next in thread | raw e-mail | index | archive | help
> Compared with the use of tsleep(), mutexes have a number of > advantages: > > - Each mutex has its own wait (sleep) queue. When a process releases > a mutex, it automatically schedules the next process waiting on the > queue. This is more efficient than searching a possibly very long, > linear sleep queue. It also avoids the flooding when multiple > processes get scheduled, and most of them have to go back to sleep > again. > What about processes of different priorities blocking for the same mutex? Would you do a linear search on the queue? or have the queue sorted by priority? or a FIFO queue is good enough? -lq To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-smp" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?200006261646.e5QGkUS06290>