It's not bottlenecks so much as it is the need to do some things
speculatively, but what I have in mind is too much to do for now.
> I was thinking that kswapd could use some of it's spare time to do an LRU
> paging scan, consolidate free space, and possibly do remapping of process
> memory spaces to make them more efficient (map pages to contiguous chunks
> of memory and swap).
Two techniques that I think should help are:
1. make it easier to free contiguous pages (that's done and
working for me)
2. change the allocation strategy to make our common cases not
fragment memory all over the place - ie switch to a zone allocator
for pages
It's far too late in 2.1 for any truely radical changes to combat
fragmention to go into the mainstream kernel, hence we need to stick to
tweaking the behaviour of our existing code. Perhaps get_free_page
shouldn't break any of the higher memory order allocations for GFP_USER
requests when such actions will leave insufficient high-order pages
around. Couple that with kswapd now checking the available memory orders
and normal systems shouldn't suffer swapout attacks (or at least those
caused by a lack of free high-order page).
-ben
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu