Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!linus!genrad!decvax!harpo!seismo!hao!hplabs!hpda!fortune!norskog From: norskog@fortune.UUCP Newsgroups: net.micro.cpm Subject: Re: UNIX on the 68000 - (nf) Message-ID: <1105@fortune.UUCP> Date: Thu, 9-Jun-83 04:04:06 EDT Article-I.D.: fortune.1105 Posted: Thu Jun 9 04:04:06 1983 Date-Received: Sat, 11-Jun-83 20:59:54 EDT Lines: 8 #R:sri-arpa:-179700:fortune:25500001:000:310 fortune!norskog Jun 8 21:12:00 1983 It should be noted that the Berkeley paging algorithm, (global demand paging), is >20 years out of date. It has been known since the early sixties that paging a process against itself between low and high water marks (and swapping against other processes) is much more efficient than global demand paging.