From owner-freebsd-chat Sat Aug 3 13:13:04 1996 Return-Path: owner-chat Received: (from root@localhost) by freefall.freebsd.org (8.7.5/8.7.3) id NAA07919 for chat-outgoing; Sat, 3 Aug 1996 13:13:04 -0700 (PDT) Received: from kropotkin.gnu.ai.mit.edu (kropotkin.gnu.ai.mit.edu [128.52.46.40]) by freefall.freebsd.org (8.7.5/8.7.3) with SMTP id NAA07906 for ; Sat, 3 Aug 1996 13:12:59 -0700 (PDT) Received: by kropotkin.gnu.ai.mit.edu (8.6.12/8.6.12GNU) id QAA17287; Sat, 3 Aug 1996 16:12:37 -0400 Date: Sat, 3 Aug 1996 16:12:37 -0400 Message-Id: <199608032012.QAA17287@kropotkin.gnu.ai.mit.edu> To: narvi@haldjas.folklore.ee CC: garyh@agora.rdrop.com, kline@tera.com, kline@tera.com, freebsd-chat@freebsd.org In-reply-to: (message from Narvi on Sat, 3 Aug 1996 23:09:12 +0300 (EET DST)) Subject: Re: FreeBSD and Mersenne Primes From: Joel Ray Holveck Reply-to: joelh@gnu.ai.mit.edu Sender: owner-chat@freebsd.org X-Loop: FreeBSD.org Precedence: bulk >>> 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.