At 06:19 AM 4/22/02 +0000, you wrote: >I've been running Prime95 on my 2 pc's since January >2002, I started using it as a benchmark to test the >system I just built and ended up starting my own team on >2 pcs. My new system has an AMD Athalon 1400mhz >processor and has been crunching the numbers in about 3 >weeks or so and my per iteration time has always been >around 0.098 to 0.099, Since I got my newest number >(33238643), My per iteration time has gone up to 0.250 >to 0.259 and my status tells me it wont finish until >August 12th. Thats almost 4 months, any suggestions?
That's about right for that processor on a number that size. You seem to have set the choice for which work to "money-awarded" winners if a prime is found, i.e. 10 million digits or more. Larger numbers take much longer to test for two reasons. 1) If the exponent is "P", it has to to "P" iterations -- the larger "P" is, the more iterations there are. 2) The larger "P" is, the longer each iteration TAKES, too. The length of time to test a larger exponent is NOT linear -- it grows MUCH faster than that, so if P doubles, it is NOT twice as long, but perhaps as much as five to ten times as long. >Should I or can I go to advanced menu and Unreserve the >exponent and get another one? Only if you need more immediate results for ego reasons. The computer is doing the same amount of work in terms of FLOPS, no matter the size. You'll test fewer exponents this way, but you stand to win money if you are the lucky one that finds a prime that large. >My other pc has a pIII 600mhz, and it's per iteration >time is about 0.269 to 0.285, but status says it will be >done on May 26th. Whats happened?? That exponent is likely much smaller than 33,000,000. _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
