On Tue, 16 Sep 2008 15:46:28 +0800 "Peter Teoh" <[EMAIL PROTECTED]> wrote:
> > Anonymous (and other swap backed) pages use a simple two-handed > > clock replacement algorithm, while file backed pages use a > > use-once algorithm that somewhat resembles 2Q. Pages that cannot > > be evicted are placed on the unevictable list, to keep them out > > of the way of the VM. > > I don't quite understand this part......can someone help me out with > the source code reference for this? Where is this two-handed clock > implemented? It's in the -mm kernel. The mainline kernel.org tree does not have this code (yet). > And what is the 2Q ie, the name of the queue for this? > What conditions prevent them from being evicted? http://linux-mm.org/PageReplacementDesign -- All rights reversed. -- To unsubscribe from this list: send an email with "unsubscribe kernelnewbies" to [EMAIL PROTECTED] Please read the FAQ at http://kernelnewbies.org/FAQ
