Messages in this thread | | | Date | Tue, 30 Aug 2005 12:53:18 +1000 | From | Nick Piggin <> | Subject | Re: [PATCH] make radix tree gang lookup faster by using a bitmap search |
| |
James Bottomley wrote:
>On Tue, 2005-08-30 at 10:56 +1000, Nick Piggin wrote: > > >>Gang lookup is mainly used on IO paths but also on truncate, >>which is a reasonably fast path on some workloads (James, >>this is my suggestion for what you should test - truncate). >> > >Actually, I don't think I can test this. In order to show a difference >between index 5 and index 6 on 32 bit, I'd have to deal with files > 4GB >in size. My 32 bit machines are the voyagers and only have 4GB discs. > >The machine with all the huge discs, is, naturally, ia64. > >
Sorry, I meant for testing your gang lookup speedups.
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.
Nick
Send instant messages to your online friends http://au.messenger.yahoo.com
- 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/
| |