Return-Path: <linux-kernel-owner@vger.kernel.org>
Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand
	id <S289173AbSAGLFA>; Mon, 7 Jan 2002 06:05:00 -0500
Received: (majordomo@vger.kernel.org) by vger.kernel.org
	id <S289174AbSAGLEv>; Mon, 7 Jan 2002 06:04:51 -0500
Received: from holomorphy.com ([216.36.33.161]:25552 "EHLO holomorphy")
	by vger.kernel.org with ESMTP id <S289173AbSAGLEm>;
	Mon, 7 Jan 2002 06:04:42 -0500
Date: Mon, 7 Jan 2002 03:03:44 -0800
From: William Lee Irwin III <wli@holomorphy.com>
To: Peter W?chtler <pwaechtler@loewe-komp.de>
Cc: Christoph Hellwig <hch@caldera.de>, linux-mm@kvack.org,
        lkml <linux-kernel@vger.kernel.org>, velco@fadata.bg
Subject: Re: [PATCH] updated version of radix-tree pagecache
Message-ID: <20020107030344.H10391@holomorphy.com>
Mail-Followup-To: William Lee Irwin III <wli@holomorphy.com>,
	Peter W?chtler <pwaechtler@loewe-komp.de>,
	Christoph Hellwig <hch@caldera.de>, linux-mm@kvack.org,
	lkml <linux-kernel@vger.kernel.org>, velco@fadata.bg
In-Reply-To: <20020105171234.A25383@caldera.de> <3C3972D4.56F4A1E2@loewe-komp.de>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Description: brief message
Content-Disposition: inline
User-Agent: Mutt/1.3.17i
In-Reply-To: <3C3972D4.56F4A1E2@loewe-komp.de>; from pwaechtler@loewe-komp.de on Mon, Jan 07, 2002 at 11:05:08AM +0100
Organization: The Domain of Holomorphy
Sender: linux-kernel-owner@vger.kernel.org
X-Mailing-List: linux-kernel@vger.kernel.org

Christoph Hellwig schrieb:
>> [please Cc velco@fadata.bg and lkml on reply]
>> 
>> I've just uploaded an updated version of Momchil Velikov's patch for a
>> scalable pagecache using radix trees.  The patch can be found at:
>> 
>> It contains a number of fixed and improvements by Momchil and me.

On Mon, Jan 07, 2002 at 11:05:08AM +0100, Peter W?chtler wrote:
> Can you sum up the advantages of this implementation?
> I think it scales better on "big systems" where otherwise you end up
> with many pages on the same hash?
> 
> Is it beneficial for small systems? (I think not)

I speculate this would be good for small systems as well as it reduces
the size of struct page by 2*sizeof(unsigned long) bytes, allowing more
incremental allocation of pagecache metadata. I haven't tried it on my
smaller systems yet (due to lack of disk space and needing to build the
cross-toolchains), though I'm now curious as to its exact behavior there.

Has anyone tried to do accounting on the radix tree metadata overhead yet?

Cheers,
Bill
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/