mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2010-10-05, 03:12   #122
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts
Default

Quote:
Originally Posted by lpmurray View Post
I can't believe people are so petty about increasing the score that the would steal other peoples work.
I don't know if people actually do that, but it's best to guard against it, in any case. Score aside, we wouldn't want to miss a prime, or otherwise have garbage data, (if not total garbage, at least not up to the mathematician's standard of close-as-possible-to-perfection) just because it was easy for some "doublecheckers" to do no work and just report the last person's residues.

Last fiddled with by Mini-Geek on 2010-10-05 at 03:13
Mini-Geek is online now   Reply With Quote
Old 2010-10-06, 01:51   #123
Rhyled
 
Rhyled's Avatar
 
May 2010

3F16 Posts
Thumbs up 26.2 passes 4 LL-D tests

I just completed 4 LL-D checks using 26.2 64-bit. All four successfully completed the double checks by verifying the previous LL run, so I'm happy with the accuracy of 26.2 for LL tests.
(M24309653, M24350327, M24441799, M24309661)

I'm also happy with the performance. No worse than a 0.25 round off error (that I saw). Approximately a 15% increase in calculation speed, less a 2% drop because I had SUM(Inputs) and Roundoff error checking marked. Per iteration time was ~ 16ms (i7-920 @ 3.71 GHz) for a 1280K FFT.

I'm trying ECM & ECM-F runs next - but unless I find a factor, that's going to be a less certain test than LL-D.

Nice job, George.

Last fiddled with by Rhyled on 2010-10-06 at 01:52
Rhyled is offline   Reply With Quote
Old 2010-10-08, 01:11   #124
JuanTutors
 
JuanTutors's Avatar
 
Mar 2004

1111001002 Posts
Default

I once requested that on multi-core computers, the LL test of a 100M digit Mersenne be started during the part of the P-1 factoring that does not take up all cores of the processor. (My argument was based on computer lifetime and human lifetime arguments).

Can you add this feature as an option that can be written into prime.txt?

Last fiddled with by JuanTutors on 2010-10-08 at 01:12
JuanTutors is offline   Reply With Quote
Old 2010-10-08, 02:16   #125
Rhyled
 
Rhyled's Avatar
 
May 2010

32×7 Posts
Thumbs up 26.2 finds ECM factor

I got lucky and found an ECM factor in my first dozen attempts on 26.2. (M5308217) I have no idea if the ECM speed is any different than the previous version, but the logic looks solid.

Back to my search for the 48th
Rhyled is offline   Reply With Quote
Old 2010-10-08, 02:49   #126
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts
Default

Quote:
Originally Posted by Rhyled View Post
I have no idea if the ECM speed is any different than the previous version, but the logic looks solid.
It should be faster by about the same degree that LL tests are, since they all (LL/DC, P-1, ECM) use the FFT. The TF code wasn't improved, but the FFT code was.
Mini-Geek is online now   Reply With Quote
Old 2010-10-09, 04:43   #127
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22·3·641 Posts
Default

Quote:
Originally Posted by dominicanpapi82 View Post
I once requested that on multi-core computers, the LL test of a 100M digit Mersenne be started during the part of the P-1 factoring that does not take up all cores of the processor.
As Mini-Geek has just pointed out in response to another post, the main loop of P-1 performs FFT operations, just as the main loop of LL/DC (and ECM) does. So there's no intrinsic difference in processor core usage between them. They're all using the same FFT calculation subroutines. If P-1 is taking "up all cores of the processor", then it will do so practically all the time.

If you're referring to the non-FFT operations in P-1: they occupy only a very small slice of time, principally for the GCD calculation, which takes only a few minutes at most, at the end of stage 1 or stage 2.

Were you perhaps thinking of stage 2's large memory usage? That bears no relation to the number of processor cores used.

Last fiddled with by cheesehead on 2010-10-09 at 04:52
cheesehead is offline   Reply With Quote
Old 2010-10-09, 06:42   #128
diep
 
diep's Avatar
 
Sep 2006
The Netherlands

10101000102 Posts
Default

Quote:
Originally Posted by cheesehead View Post
As Mini-Geek has just pointed out in response to another post, the main loop of P-1 performs FFT operations, just as the main loop of LL/DC (and ECM) does. So there's no intrinsic difference in processor core usage between them. They're all using the same FFT calculation subroutines. If P-1 is taking "up all cores of the processor", then it will do so practically all the time.

If you're referring to the non-FFT operations in P-1: they occupy only a very small slice of time, principally for the GCD calculation, which takes only a few minutes at most, at the end of stage 1 or stage 2.

Were you perhaps thinking of stage 2's large memory usage? That bears no relation to the number of processor cores used.
LL / LLR is just squaring in most cases and taking easy modulo.

So it's a simpler form of a FFT in case of LL/LLR when compared with most generic codes which need regurarly multiplication and not so easy modulo.
diep is offline   Reply With Quote
Old 2010-10-11, 08:41   #129
hgj9999
 
Oct 2010

1 Posts
Default

Does 26.2 support Windows 7? If so, both 32bit and 64bit are support?
hgj9999 is offline   Reply With Quote
Old 2010-10-12, 03:01   #130
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

10DA16 Posts
Default

Quote:
Originally Posted by Prime95 View Post
Known bugs and fixes:

... Fixed in 26.3 ...
Is there an estimated date for 26.3 to be available?
petrw1 is offline   Reply With Quote
Old 2010-10-12, 05:03   #131
Svenie25
 
Svenie25's Avatar
 
Aug 2008
Good old Germany

3·47 Posts
Default

Quote:
Originally Posted by hgj9999 View Post
Does 26.2 support Windows 7? If so, both 32bit and 64bit are support?
I myself use it under W7 64bit without any problems.
Svenie25 is offline   Reply With Quote
Old 2010-10-13, 05:31   #132
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22×3×641 Posts
Default

Quote:
Originally Posted by diep View Post
Quote:
Originally Posted by cheesehead View Post
As Mini-Geek has just pointed out in response to another post, the main loop of P-1 performs FFT operations, just as the main loop of LL/DC (and ECM) does. So there's no intrinsic difference in processor core usage between them. They're all using the same FFT calculation subroutines. If P-1 is taking "up all cores of the processor", then it will do so practically all the time.

If you're referring to the non-FFT operations in P-1: they occupy only a very small slice of time, principally for the GCD calculation, which takes only a few minutes at most, at the end of stage 1 or stage 2.

Were you perhaps thinking of stage 2's large memory usage? That bears no relation to the number of processor cores used.
LL / LLR is just squaring in most cases and taking easy modulo.

So it's a simpler form of a FFT in case of LL/LLR when compared with most generic codes which need regurarly multiplication and not so easy modulo.
How is your comment related to processor core use during the P-1 main FFT loop in comparison to processor core use during the LL main FFT loop?
cheesehead is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime95 version 27.3 Prime95 Software 148 2012-03-18 19:24
Prime95 version 26.3 Prime95 Software 76 2010-12-11 00:11
Prime95 version 25.5 Prime95 PrimeNet 369 2008-02-26 05:21
Prime95 version 25.4 Prime95 PrimeNet 143 2007-09-24 21:01
When the next prime95 version ? pacionet Software 74 2006-12-07 20:30

All times are UTC. The time now is 21:07.

Fri Jul 3 21:07:22 UTC 2020 up 100 days, 18:40, 1 user, load averages: 1.33, 1.23, 1.30

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.