Re: [PATCH 3/4] mm: slub: Do not take expensive steps for SLUBsspeculative high-order allocations

From: David Rientjes
Date: Tue May 17 2011 - 15:35:51 EST

On Tue, 17 May 2011, Christoph Lameter wrote:

> > In this particular patch, the success rate for high order allocations
> > would likely decrease in low memory conditions albeit the latency when
> > calling the page allocator will be lower and the disruption to the
> > system will be less (no copying or reclaim of pages). My expectation
> > would be that it's cheaper for SLUB to fall back than compact memory
> > or reclaim pages even if this means a slab page is smaller until more
> > memory is free. However, if the "goodness" criteria is high order
> > allocation success rate, the patch shouldn't be merged.
> The criteria is certainly overall system performance and not a high order
> allocation rate.

SLUB definitely depends on these higher order allocations being successful
for performance, dropping back to the min order is a last resort as
opposed to failing the kmalloc(). If it's the last resort, then it makes
sense that we'd want to try both compaction and reclaim while we're
already in the page allocator as we go down the slub slowpath. Why not
try just a little harder (compaction and/or reclaim) to alloc the cache's
preferred order?
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at
Please read the FAQ at