Berkeley paging

[Doug Gwyn]

In article <11484 at mimsy.UUCP> chris at mimsy.UUCP (Chris Torek) writes:
>Indeed, it can be argued that the clock scheme is more `Unix-like' than
>the working set scheme; ...

That's true.  The way I like to view the difference is that under the
"working set" scheme, a process competes for memory pages only against
itself, whereas under the alternative "global" scheme, all processes
compete against each other for memory pages.  The former is "fairer"
and therefore more suitable for real-time oriented systems, while the
latter is arguably more globally efficient and certainly feels more
like a traditional UNIX way of doing business.