> 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? And what is the 2Q ie, the name of the queue for this? What conditions prevent them from being evicted? Thanks. -- Regards, Peter Teoh -- To unsubscribe from this list: send an email with "unsubscribe kernelnewbies" to ecartis@xxxxxxxxxxxx Please read the FAQ at http://kernelnewbies.org/FAQ
