On Tue, 6 Nov 2007 18:40:46 -0800 (PST)
Christoph Lameter <clameter@sgi.com> wrote:
Which is why we need to greatly reduce the number of pages
scanned to free a page. In all workloads.
An algorithm that only clears the referenced bit and then
moves the anonymous page from the active to the inactive
list will do a lot less work than an algorithm that needs
to scan the *whole* active list because all of the pages
on it are referenced.
This is not a theoretical situation: every anonymous page
starts out referenced!
Add in a relatively small inactive list on huge memory
systems, and we could have something of an acceptable
algorithmic complexity.
--
"Debugging is twice as hard as writing the code in the first place.
Therefore, if you write the code as cleverly as possible, you are,
by definition, not smart enough to debug it." - Brian W. Kernighan
-