Date: Sat, 3 Aug 1996 23:09:12 +0300 (EET DST) From: Narvi <narvi@haldjas.folklore.ee> To: Joel Ray Holveck <joelh@gnu.ai.mit.edu> Cc: garyh@agora.rdrop.com, kline@tera.com, kline@tera.com, freebsd-chat@freebsd.org Subject: Re: FreeBSD and Mersenne Primes Message-ID: <Pine.BSF.3.91.960803230805.218M-100000@haldjas.folklore.ee> In-Reply-To: <199608031941.PAA17213@kropotkin.gnu.ai.mit.edu>
next in thread | previous in thread | raw e-mail | index | archive | help
On Sat, 3 Aug 1996, Joel Ray Holveck wrote: > > >> I guess it would be asking a bit much for a P5 to go up against an > >> XMP (or whatever it was that Slowinski used). > > There was some data in the first announcement that I saw about the > > project (or perhaps on the web site) that *in this application* 4 > > Pentium 133(?)s = one Cray. > > Is this factoring in code optimized for a Cray? On typical mundane > code, the Cray is nothing spectacular; just for code that has been > vectorized. Perhaps it can't be vectorized? Would it actually be possible to vestorize prime searcing programs? Sander > > -- > http://www.wp.com/piquan --- Joel Ray Holveck --- joelh@gnu.ai.mit.edu > > The number you have reached is an imaginary number. > Please rotate your phone 90 degrees and try again. >
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.BSF.3.91.960803230805.218M-100000>