Date: Sat, 3 Aug 1996 16:12:37 -0400 From: Joel Ray Holveck <joelh@gnu.ai.mit.edu> To: narvi@haldjas.folklore.ee Cc: garyh@agora.rdrop.com, kline@tera.com, kline@tera.com, freebsd-chat@freebsd.org Subject: Re: FreeBSD and Mersenne Primes Message-ID: <199608032012.QAA17287@kropotkin.gnu.ai.mit.edu> In-Reply-To: <Pine.BSF.3.91.960803230805.218M-100000@haldjas.folklore.ee> (message from Narvi on Sat, 3 Aug 1996 23:09:12 %2B0300 (EET DST))
next in thread | previous in thread | raw e-mail | index | archive | help
>>> 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? I find that with a little creativity, most number-crunching algorithms can be vectorized. I'm not going to venture to work on this particular prime-searching algorithm, esp not in FreeBSD-*, but I would think the algorithm probably could be. -- 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?199608032012.QAA17287>