From owner-freebsd-arch Wed May 17 11:16: 2 2000 Delivered-To: freebsd-arch@freebsd.org Received: from smtp04.primenet.com (smtp04.primenet.com [206.165.6.134]) by hub.freebsd.org (Postfix) with ESMTP id 0705037B8DB; Wed, 17 May 2000 11:15:57 -0700 (PDT) (envelope-from tlambert@usr05.primenet.com) Received: (from daemon@localhost) by smtp04.primenet.com (8.9.3/8.9.3) id LAA23539; Wed, 17 May 2000 11:15:22 -0700 (MST) Received: from usr05.primenet.com(206.165.6.205) via SMTP by smtp04.primenet.com, id smtpdAAAvZaO0T; Wed May 17 11:15:13 2000 Received: (from tlambert@localhost) by usr05.primenet.com (8.8.5/8.8.5) id LAA07310; Wed, 17 May 2000 11:15:38 -0700 (MST) From: Terry Lambert Message-Id: <200005171815.LAA07310@usr05.primenet.com> Subject: Re: A new api for asynchronous task execution To: msmith@FreeBSD.ORG (Mike Smith) Date: Wed, 17 May 2000 18:15:38 +0000 (GMT) Cc: tlambert@primenet.com (Terry Lambert), dfr@nlsystems.com (Doug Rabson), msmith@FreeBSD.ORG (Mike Smith), n_hibma@calcaphon.com (Nick Hibma), arch@FreeBSD.ORG In-Reply-To: <200005171758.KAA07014@mass.cdrom.com> from "Mike Smith" at May 17, 2000 10:58:42 AM X-Mailer: ELM [version 2.5 PL2] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-freebsd-arch@FreeBSD.ORG Precedence: bulk X-Loop: FreeBSD.ORG > > > 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. Terry Lambert terry@lambert.org --- Any opinions in this posting are my own and not those of my present or previous employers. To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-arch" in the body of the message