| Date | Mon, 16 Mar 2009 11:40:54 +0100 | From | Nick Piggin <> | Subject | Re: [PATCH 00/35] Cleanup and optimise the page allocator V3 |
| |
On Mon, Mar 16, 2009 at 09:45:55AM +0000, Mel Gorman wrote: > Here is V3 of an attempt to cleanup and optimise the page allocator and should > be ready for general testing. The page allocator is now faster (16% > reduced time overall for kernbench on one machine) and it has a smaller cache > footprint (16.5% less L1 cache misses and 19.5% less L2 cache misses for > kernbench on one machine). The text footprint has unfortunately increased, > largely due to the introduction of a form of lazy buddy merging mechanism > that avoids cache misses by postponing buddy merging until a high-order > allocation needs it.
You!? You want to do lazy buddy? ;) That's wonderful, but it would significantly increase the fragmentation problem, wouldn't it? (although pcp lists are conceptually a form of lazy buddy already)
No objections from me of course, if it is making significant speedups. I assume you mean overall time on kernbench is overall sys time?
|