lkml.org 
[lkml]   [1997]   [Jul]   [1]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: Page cache patch - less aggressive
> 
> Ummm, I have no idea why the old buffer cache code is being
> reintroduced in these patch sets. Linus has already made
> it perfectly clear that first priority is to get things working
> without reverting back to the old code, and that only if it
> is found to be impossible to make things work with the new
> code would reverting be even considered at all.
>

During testing the new buffer code I found that find_candidate()
called very often in refill_freelist() runs try_to_free_buffer()
... this seems to free the previous buffer pages allocated by
grow_buffers() in refill_freelist() and leads to heavy swap I/O
and cpu waste in less physical memory situations. Therefore I've
switched back to the old buffer code ... this is what I've written
a few days ago.

Does any body know a simple fix for find_candidate() in the
new buffer code to avoid this behaviour?



Werner

\
 
 \ /
  Last update: 2005-03-22 13:39    [W:0.059 / U:0.056 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site