Date: Wed, 31 Mar 2010 16:22:58 +0200 From: Roman Divacky <rdivacky@freebsd.org> To: Tsuyoshi Ozawa <ozawa+bsd@t-oza.net> Cc: Dag-Erling Sm?rgrav <des@des.no>, Julian Elischer <julian@elischer.org>, freebsd-hackers <freebsd-hackers@freebsd.org> Subject: Re: Dynamic ticks in FreeBSD Message-ID: <20100331142258.GA33359@freebsd.org> In-Reply-To: <p2p411a180c1003310505qb6e274f2i7b39aa3dd7387d24@mail.gmail.com> References: <411a180c1003300537g2a1b4879u2d8d952ce9977cb5@mail.gmail.com> <411a180c1003300639l13d33451q305a61b2bcd6e3d5@mail.gmail.com> <20100330173504.GA70578@freebsd.org> <p2p411a180c1003310505qb6e274f2i7b39aa3dd7387d24@mail.gmail.com>
next in thread | previous in thread | raw e-mail | index | archive | help
On Wed, Mar 31, 2010 at 04:05:33AM -0800, Tsuyoshi Ozawa wrote: > Thank you for replying ! > > The patch for FreeBSD 8.0 original source is here : > http://gist.github.com/350230 looks good I wonder - why don't we store the callouts in binary tree so the searching for nearest callout is faster? what is the average length of the callout queue?
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20100331142258.GA33359>