On 11/07/2012 03:19 AM, Dave Hansen wrote: > On 11/06/2012 11:53 AM, Srivatsa S. Bhat wrote: >> This is the main change - we keep the pageblocks in region-sorted order, >> where pageblocks belonging to region-0 come first, followed by those belonging >> to region-1 and so on. But the pageblocks within a given region need *not* be >> sorted, since we need them to be only region-sorted and not fully >> address-sorted. >> >> This sorting is performed when adding pages back to the freelists, thus >> avoiding any region-related overhead in the critical page allocation >> paths. > > It's probably _better_ to do it at free time than alloc, but it's still > pretty bad to be doing a linear walk over a potentially 256-entry array > holding the zone lock. The overhead is going to show up somewhere. How > does this do with a kernel compile? Looks like exit() when a process > has a bunch of memory might get painful. > As I mentioned in the cover-letter, kernbench numbers haven't shown any observable performance degradation. On the contrary, (as unbelievable as it may sound), they actually indicate a slight performance *improvement* with my patchset! I'm trying to figure out what could be the reason behind that. Going forward, we could try to optimize the sorting logic in the free() part, but in any case, IMHO that's the right place to push the overhead to, since the performance of free() is not expected to be _that_ critical (unlike alloc()) for overall system performance. Regards, Srivatsa S. Bhat -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to majordomo@xxxxxxxxx. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: <a href=mailto:"dont@xxxxxxxxx";> email@xxxxxxxxx </a>