Date: Mon, 26 Jun 2000 12:49:00 -0700 (PDT) From: Matthew Dillon <dillon@apollo.backplane.com> To: Matthew Dillon <dillon@apollo.backplane.com> Cc: Luoqi Chen <luoqi@watermarkgroup.com>, jasone@canonware.com, smp@FreeBSD.ORG Subject: Re: SMP meeting summary Message-ID: <200006261949.MAA29502@apollo.backplane.com> References: <200006261646.e5QGkUS06290@lor.watermarkgroup.com> <200006261926.MAA29301@apollo.backplane.com>
next in thread | previous in thread | raw e-mail | index | archive | help
::priority? or a FIFO queue is good enough?
::
::-lq
:
: I've found the a sorted queue is best for this sort of thing. It
: is possible to do a low-overhead sorted queue by having the insertion
: code scan from the beginning forward AND the end backwards until it
: finds the insertion point. Usually it finds the insertion point in only
: one or two iterations.
:
: The wakeup code then simply pops the first proc from the queue and wakes
: it up.
Scrap my last comment, I must be high.
Jason's explanation is the right one (priority lending).
-Matt
Matthew Dillon
<dillon@backplane.com>
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?200006261949.MAA29502>