Date: Tue, 13 Jun 2006 06:23:46 -0600 (MDT) From: Rick Kelly <rmk@toad.rmkhome.com> To: Johnny Billquist <bqt@update.uu.se> Cc: John Nemeth <jnemeth@victoria.tc.ca>, misc@openbsd.org, Otto Moerbeek <otto@drijf.net>, Ted Unangst <ted.unangst@gmail.com>, Ted Mittelstaedt <tedm@toybox.placo.com>, Marcus Watts <mdw@umich.edu>, freebsd-questions@freebsd.org, =?ISO-8859-1?Q?H=E1morszky_Bal=E1zs?= <balihb@ogyi.hu>, netbsd-users@NetBSD.org, Nikolas Britton <nikolas.britton@gmail.com> Subject: Re: wikipedia article Message-ID: <200606131223.k5DCNkcB021980@toad.rmkhome.com> In-Reply-To: <448E91A8.4040809@update.uu.se>
next in thread | previous in thread | raw e-mail | index | archive | help
Johnny Billquist said: >> There's actually a cheesy way to do demand paging with microprocessors >> that don't support demand paging (such as the original 68000--another >> "16 bit" machine). The way to do this is to run two processors in parallel >> but skewed by one instruction. If the first one does a bad memory fetch, >> then the second one will not have fetched the instruction causing the >> fault so contains restartable machine state. Masscomp sold a machine >> like this once. >Didn't the first Apollos do this? And also the Sun 1. -- Rick Kelly rmk@rmkhome.com <http://www.rmkhome.com/>; <http://rkba.rmkhome.com/>;
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?200606131223.k5DCNkcB021980>