Messages in this thread | | | From | Daniel Phillips <> | Subject | Re: [PATCH] updated version of radix-tree pagecache | Date | Mon, 7 Jan 2002 13:53:12 +0100 |
| |
On January 7, 2002 12:03 pm, William Lee Irwin III wrote: > 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.
Benchmark it on UML. In my experience, performance on UML is quite predictive of performance on native systems.
-- Daniel - 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/
| |