Date: Mon, 22 Aug 2005 11:07:47 +0000 From: Alexey Dokuchaev <danfe@FreeBSD.org> To: Andre Oppermann <andre@freebsd.org> Cc: arch@freebsd.org Subject: Re: fdesc allocation optimization Message-ID: <20050822110747.GA32862@FreeBSD.org> In-Reply-To: <4309AE1E.8FCC9E1E@freebsd.org> References: <20050822100059.GA24626@FreeBSD.org> <4309AE1E.8FCC9E1E@freebsd.org>
next in thread | previous in thread | raw e-mail | index | archive | help
On Mon, Aug 22, 2005 at 12:51:10PM +0200, Andre Oppermann wrote: > Alexey Dokuchaev wrote: > > > > hi there, > > > > i've been browsing some of dfbsd resources recently, and found this one > > being pretty interesting: > > > > http://leaf.dragonflybsd.org/mailarchive/commits/2005-06/msg00526.html > > > > however, it seemingly did not get attention in our lists. so i am > > wondering if there are work/plans on porting hsu@'s work? i remember > > that at some point we adopted some openbsd-derived algorithm, but since > > matt states that this is "far better algorithm then anything we or > > freebsd thought up before", i figured it worth a look. > > Looks certainly good. Why don't you go ahead and port it over? i was thinking about porting it myself, but just wanted to check maybe someone or even hsu@ already does the work. plus, i'm not really fdesc guru after all. ./danfe
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20050822110747.GA32862>