From: Matthew Dillon <redacted>
The algorithm is a *modified* LRU. Lets say you decide on a weighting
betweeen 0 and 10. When a page is first allocated (either to the
buffer cache or for anonymous memory) its statistical weight is
set to the middle (5). If the page is used often the statistical
weight slowly rises to its maximum (10). If the page remains idle
(or was just used once) the statistical weight slowly drops to its
minimum (0).
My patches has been approaching this a while... [slowly...]
The currently included patch adds has divided lru in four lists [0..3].
New pages are added at level 1.
Scan is performed - and referenced pages are moved up.
Pages are moved down due to list balancing, but I have been playing with
other ideas.
These patches should be a good continuation point.
Patches are against pre9-3 with Quintela applied.
/RogerL
--
Home page:
http://www.norran.net/nra02596/