From: Amin Azez Subject: Re: Hashtrie testing2, dancing trees Date: Thu, 30 Mar 2006 09:28:40 +0100 Message-ID: <442B96B8.4080405@ufomechanic.net> References: <43EFF1F0.1090701@netfilter.org> <20060213112028.GU4601@sunbeam.de.gnumonks.org> <43F438F5.8070607@trash.net> <43F43FA9.4000906@trash.net> <43F4426D.9060807@trash.net> <43F4DBDF.9010008@trash.net> <1141503111.3881.61.camel@localhost.localdomain> <1141580938.3881.129.camel@localhost.localdomain> <1141756438.3881.158.camel@localhost.localdomain> Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Cc: Netfilter Development Mailinglist Return-path: To: Martin Josefsson In-Reply-To: <1141756438.3881.158.camel@localhost.localdomain> List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Sender: netfilter-devel-bounces@lists.netfilter.org Errors-To: netfilter-devel-bounces@lists.netfilter.org List-Id: netfilter-devel.vger.kernel.org Just for interest, and I don't know how well tuned for processor cache it is, but Hans Reisers dancing trees are build to solve some of this problem; dancing trees keep themselves balanced. I realise that filesystem timescales are not the same as packet processing timecales, I merely mention it for completeness. Sam