----- Original Message -----
From: Brian J. Beesley <[EMAIL PROTECTED]>
> However, the FFT itself is very amenable to parallel processing
> techniques - on a processor with N independent compute pathways, you
> can compute N elements in the same time that a single element would
> take to compute just one.
>
How much of the mersenne-test is used for the FFT then?
Isn't the FFT the single most time-consuming part?
Wouldn't it make sense to make a parallelized version of prime95 that
distributes the FFT over N processors?
Regards, Lars
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
