lkml.org 
[lkml]   [1999]   [Apr]   [1]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: buffer cache behavior on memory-constrained systems (fwd)
On Wed, 31 Mar 1999, Chuck Lever wrote:
> the reason i asked "how optimal" is because the LRU algorithm Andrea added
> was for *pages*, not for buffers. i'm curious how close to LRU buffer

Me too. I've never said *buffers*.

> replacement we can get with LRU *page* replacement.

Me too, but not only in its relationship with buffers but also how he
implements a very "expensive" algorithm for page replacement.

--
Ricardo Galli



-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/

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