From owner-freebsd-hackers Wed Sep 8 17:38:50 1999 Delivered-To: freebsd-hackers@freebsd.org Received: from scam.xcf.berkeley.edu (scam.XCF.Berkeley.EDU [128.32.43.201]) by hub.freebsd.org (Postfix) with SMTP id F0969151A9 for ; Wed, 8 Sep 1999 17:38:48 -0700 (PDT) (envelope-from nordwick@scam.xcf.berkeley.edu) Received: (qmail 66141 invoked by uid 27268); 9 Sep 1999 00:37:57 -0000 Message-ID: <19990909003757.66140.qmail@scam.xcf.berkeley.edu> To: freebsd-hackers@freebsd.org Subject: message queues for I/O (usenix paper) MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-ID: <66138.936837476.1@scam.XCF.Berkeley.EDU> Date: Wed, 08 Sep 1999 17:37:57 -0700 From: "Jayson Nordwick" Sender: owner-freebsd-hackers@FreeBSD.ORG Precedence: bulk X-Loop: FreeBSD.ORG There is alot of talk going on over at the linux-kernel mailing list about implementing synchronous messaging for I/O. They are talking about a paper that was presented at USENIX: http://www.cs.rice.edu/~gaurav/papers/usenix99.ps The general idea is that select() and poll() fall over with large numbers of file descriptors for two reasons. First, scanning the interest list begins to consume more time. Second, the stateless nature between calls means that alot of redundant processing occurs. The solution these guys (the authors) say is to have a way of registering interest in descriptors, then you can call a procedure to find out what has changed since last time. I personally think that select() is just fine and can be implemented more efficiently than currently, but I would be willing to give it a shot at both cooperating with the Linux people to get a good Linux/FreeBSD API layed down and then implementing it. I know some of you heard this paper presented so does anybody have any ideas about it? Does anybody care? -jason To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message