> Factoring could easily be parallelized, since it consists of 16 passes.
> And the total amount of data being transported is very small.

If so, someone build me a paralellized factoring program and I'll run it on
my quad CPU machines.  :-)  *If* that were to happen, would it be possible
to look for factors bigger than the current ~64bit numbers?  Have it run
back and look for factors of the Mersenne numbers....

________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm

Reply via email to