On Wed, Jul 11, 2007 at 04:59:46AM +0200, Nick Piggin wrote:
However much one improves fragmentation the chances of finding a
higher order page is always going to be lower than that of geting
an order-0, there are less of them for a start. It is pretty much
inevitable that you would want to have a fallback for anything
which is critical for system continuation. The thrust of the
anti-fragmentation work is not to claim a guarenteed availability but
to expand the range of order over which we find a high probability
of availability. As you say elsewhere orders 0-2 pretty much work
with buddy even in the face of random allocation, where intution
might indicate it should not. Simplistic reclaim can find us a page.
Indeed you then find that the kernel uses those sizes in preference
to order-0 for simplicity as they can be pretty much relied on, as
is done with the process kernel stacks. Much of what is proposed
as uses for this work is an extension of this, using bigger pages
where available for performance or simplicity. SLUB as an example is
making use of the fact that general availablity of near zero order
is virtually guarenteed. Obviously as order increases cirtainly
decreases and you have to trade off the ramifications of failure
to allocate against the cost of handling that failure.
Specifically thinking about the pagecache, a fusion of Christoph's
high order pagecache with fsblocks ability to handle discontigious
pages at higher order sounds like it could be a very powerful
solution to both problems, offering contigious pages where available
and working regardless where not.
-apw
-
