[lkml]   [2004]   [Oct]   [1]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [RFC] memory defragmentation to satisfy high order allocations

Marcelo Tosatti wrote:

>With such a thing in place we can build a mechanism for kswapd
>(or a separate kernel thread, if needed) to notice when we are low on
>high order pages, and use the coalescing algorithm instead blindly
>freeing unique pages from LRU in the hope to build large physically
>contiguous memory areas.
>Comments appreciated.

Hi Marcelo,
Seems like a good idea... even with regular dumb kswapd "merging",
you may easily get stuck for example on systems without swap...

Anyway, I'd like to get those beat kswapd patches in first. Then
your mechanism just becomes something like:

if order-0 pages are low {
try to free memory
else if order-1 or higher pages are low {
try to coalesce_memory
if that fails, try to free memory

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 14:06    [W:0.110 / U:0.072 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site