William L. Lynch, "The Interaction of Virtual Memory and Cache Memory,"
Technical Report CSL-TR-93-587, Computer Systems Laboratory, Department of
Electrical Enginerring and Computer Science, Standford University, October
1993.
you can find postscript at:
ftp://umunhum.stanford.edu/tr/lynch.thesis.ps.Z
Lynch describes virtual memory and cache memory interactions, and provides
a taxonomy of coloring algorithms. he then demonstrates, using
simulations and statistics, which algorithms are most effective at
reducing mean miss rate and inter-run variation. finally, he measures
changes in virtual memory behavior (e.g. page fault rate and effective
memory utilization).
Lynch shows that there are only two algorithms worth considering, and
neither of them is very complex. i think the hard part will be efficiently
managing multiple buckets of free frames of the same color, given the
lengths to which the Linux page allocator goes to achieve performance.
- Chuck Lever
-- corporate: <chuckl@netscape.com> personal: <chucklever@netscape.net> or <cel@monkey.org>
- 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/