All of lore.kernel.org
 help / color / mirror / Atom feed
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
Date: Mon, 7 Jan 2002 03:03:44 -0800	[thread overview]
Message-ID: <20020107030344.H10391@holomorphy.com> (raw)
In-Reply-To: <20020105171234.A25383@caldera.de> <3C3972D4.56F4A1E2@loewe-komp.de>
In-Reply-To: <3C3972D4.56F4A1E2@loewe-komp.de>; from pwaechtler@loewe-komp.de on Mon, Jan 07, 2002 at 11:05:08AM +0100

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

WARNING: multiple messages have this Message-ID (diff)
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
Date: Mon, 7 Jan 2002 03:03:44 -0800	[thread overview]
Message-ID: <20020107030344.H10391@holomorphy.com> (raw)
In-Reply-To: <3C3972D4.56F4A1E2@loewe-komp.de>; from pwaechtler@loewe-komp.de on Mon, Jan 07, 2002 at 11:05:08AM +0100

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, send a message with 'unsubscribe linux-mm' in
the body to majordomo@kvack.org.  For more info on Linux MM,
see: http://www.linux-mm.org/

  parent reply	other threads:[~2002-01-07 11:05 UTC|newest]

Thread overview: 14+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2002-01-05 16:12 [PATCH] updated version of radix-tree pagecache Christoph Hellwig
2002-01-07 10:05 ` Peter Wächtler
2002-01-07 10:05   ` Peter Wächtler
2002-01-07 10:07   ` Momchil Velikov
2002-01-07 10:07     ` Momchil Velikov
2002-01-07 11:03   ` William Lee Irwin III [this message]
2002-01-07 11:03     ` William Lee Irwin III
2002-01-07 12:52     ` Daniel Phillips
2002-01-07 12:52       ` Daniel Phillips
2002-01-07 12:53     ` Daniel Phillips
2002-01-07 12:53       ` Daniel Phillips
2002-01-11 23:21     ` Pavel Machek
2002-01-11 23:21       ` Pavel Machek
  -- strict thread matches above, loose matches on Subject: below --
2002-01-05 16:09 Christoph Hellwig

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=20020107030344.H10391@holomorphy.com \
    --to=wli@holomorphy.com \
    --cc=hch@caldera.de \
    --cc=linux-kernel@vger.kernel.org \
    --cc=linux-mm@kvack.org \
    --cc=pwaechtler@loewe-komp.de \
    --cc=velco@fadata.bg \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is an external index of several public inboxes,
see mirroring instructions on how to clone and mirror
all data and code used by this external index.