[lkml]   [2005]   [Aug]   [30]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH] make radix tree gang lookup faster by using a bitmap search
Sonny Rao wrote:
> On Tue, Aug 30, 2005 at 12:53:18PM +1000, Nick Piggin wrote:

>>For testing regular lookups, yeah that's more difficult. For a
>>microbenchmark you can use sparse files, which can be a good
>>trick for testing pagecache performance without the IO.
> I have a feeling that testing using sparse files should be done with
> great care to avoid exaggerating the effects of the CPU cache --
> i.e. you still need to have quite a number of pages to look up, but
> spread them apart by large offsets so that the top few levels don't
> become quickly cached for the whole test.

That's true depending on what kind of test you want to run.

Just to be clear: by 'sparse files', I mean create a huge,
sparse on-disk file from which pagecache can be arbitrarily
populated without taking up disk space by read(2)ing from it.

From the pagecache's point of view, there would be no
difference between using that or an on-disk file.


SUSE Labs, Novell Inc.

Send instant messages to your online friends

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-08-30 15:10    [W:0.080 / U:3.204 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site