Messages in this thread | ![/](/images/icornerl.gif) | | Date | Tue, 23 Apr 1996 02:43:54 -0400 (EDT) | From | Michael B Herf <> | Subject | Re: Swapping algorithm |
| |
Excerpts from internet.computing.linux-kernel: 22-Apr-96 Swapping algorithm by Jamie Lokier@rebellion.c > Occasionally, unmap a few random pages from random processes, so that > they trigger page faults and add to the statistics. The pages are still > in the page cache, of course, so it doesn't take long to map them back. > Although there is a speed penalty for this, the improved statistics, if > used well, mean that you are far less likely to swap out pages that are > actively in use. How else do you find the working set of a process > without swapping it all to disk?
Umm...you mean you can't just keep hit statistics directly?
mike
| ![\](/images/icornerr.gif) |