![]() | ||||||||||
Messages in this thread |
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/ | |||||||||
| Last update: 2005-03-22 11:15 [W:0.270 / U:0.110 seconds] ©2003-2008 Jasper Spaans | ||||||||||