Date: Wed, 17 May 2000 21:34:40 +0100 (BST) From: Doug Rabson <dfr@nlsystems.com> To: Mike Smith <msmith@FreeBSD.ORG> Cc: Terry Lambert <tlambert@primenet.com>, Nick Hibma <n_hibma@calcaphon.com>, arch@FreeBSD.ORG Subject: Re: A new api for asynchronous task execution Message-ID: <Pine.BSF.4.21.0005172133460.47945-100000@salmon.nlsystems.com> In-Reply-To: <200005171915.MAA00495@mass.cdrom.com>
next in thread | previous in thread | raw e-mail | index | archive | help
On Wed, 17 May 2000, Mike Smith wrote: > > > > > I do hope to be able to replace at least some of these pieces. I like the > > > > > idea of a priority sorted list of tasks, probably using a priority field > > > > > in struct task. > > > > > > > > Bletch. > > > > > > > > This is a job best handled by managing insertion order, rather than > > > > by way of an explicit sort. Insertion order also keeps the structure > > > > both small and generic. > > > > > > You specifically can't "manage insertion order", which is why the queues > > > need to be sorted. Go look at the current problem set before making > > > sweeping assertions like this. > > > > The "current problem set" or the "current implementation"? > > > > I know the current implementation can't handle it. > > > > I can probably give you references from as far back as the 1970's on > > why it's possible in the context of the current problem set. > > > > The DDJ article on skiplists in ~1993 (source code available from > > UUNET today) shows partially ordered insertion being applied to the > > current problem set. > > Er, that's "sorting on insertion", not "managing insertion order". Modulo some testing, my latest work-in-progress includes priority based sorting. -- 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.0005172133460.47945-100000>