mersenneforum.org Sieve Benchmark Thread
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2010-06-06, 18:03 #1 Historian     Mar 2010 43 Posts Sieve Benchmark Thread Let's get the ball rolling on this one. Processor: Pentium 4 3.4 GHz tpsieve for the variable n-range: 5M p/sec tpsieve for a single n: 71.5M p/sec NewPGen for a single n: 86M p/sec NewPGen for "Operation Megabit Twin": estimated to be 80 hours for 1T
 2010-06-06, 18:46 #2 gribozavr     Mar 2005 Internet; Ukraine, Kiev 11×37 Posts CPU: Intel i5-750 (all 4 cores loaded). tpsieve on x86_64 Linux for n=480000-485000: 108M p/sec.
2010-06-06, 21:00   #3
mdettweiler
A Sunny Moo

Aug 2007
USA (GMT-5)

11000011010012 Posts

Quote:
 Originally Posted by Historian NewPGen for "Operation Megabit Twin": estimated to be 80 hours for 1T
FYI, this converts to 3472222 p/sec, i.e. 3M p/sec since this very rough estimate is only good to one significant figure. (Just to put this in perspective with the other p/sec estimates.)

2010-06-07, 00:07   #4
Historian

Mar 2010

4310 Posts

Quote:
 Originally Posted by mdettweiler FYI, this converts to 3472222 p/sec, i.e. 3M p/sec since this very rough estimate is only good to one significant figure. (Just to put this in perspective with the other p/sec estimates.)
From what I've seen, the Megabit Twin project goes through a range of k, not a range of p. So that's ~3.5M k/sec, not 3.5M p/sec.

2010-06-07, 00:25   #5
mdettweiler
A Sunny Moo

Aug 2007
USA (GMT-5)

141518 Posts

Quote:
 Originally Posted by Historian From what I've seen, the Megabit Twin project goes through a range of k, not a range of p. So that's ~3.5M k/sec, not 3.5M p/sec.
Ah, right, I see now...most of the prime search efforts I've worked with deal with relatively small ranges of k, and thus I am used to always having an unqualified reference to the suffix "T" refer to p, not k. Since in this project both values are of magnitudes that can be reasonably referred to in T, I would suggest that in the future qualifiers be used: for example "k=1T" instead of just 1T, leaving the latter (or even better, p=1T) strictly for p references.

Last fiddled with by mdettweiler on 2010-06-07 at 00:26

 2010-06-07, 11:49 #6 amphoria     "Dave" Sep 2005 UK 23·347 Posts You can also calculate a rate in p/sec. We are currently sieving to p=100e9 and therefore 80 hours translates to 347k p/sec. Not very fast, but NewPGen has to break a 1T k range into almost 250 pieces until it gets to p=1e9.
2010-06-07, 17:01   #7
henryzz
Just call me Henry

"David"
Sep 2007
Cambridge (GMT/BST)

172F16 Posts

Quote:
 Originally Posted by amphoria You can also calculate a rate in p/sec. We are currently sieving to p=100e9 and therefore 80 hours translates to 347k p/sec. Not very fast, but NewPGen has to break a 1T k range into almost 250 pieces until it gets to p=1e9.
It is possible to change the level of the recombine. Just set a limit on the sieve to shortly after you estimate 1/250(I would recommend 1/300 or less in case of mistakes) are remaining. That could in theory mean its possible to combine really early like 1e6 or something like that.
I will do a test now to see vaguely when.
edit: ~p=4e4 would do the trick nicely

Last fiddled with by henryzz on 2010-06-07 at 17:05

2010-06-07, 18:03   #8
Flatlander
I quite division it

"Chris"
Feb 2005
England

31×67 Posts

Quote:
 Originally Posted by henryzz It is possible to change the level of the recombine. Just set a limit on the sieve to shortly after you estimate 1/250(I would recommend 1/300 or less in case of mistakes) are remaining. That could in theory mean its possible to combine really early like 1e6 or something like that. I will do a test now to see vaguely when. edit: ~p=4e4 would do the trick nicely
You saved me a job.
I was about to do some tests. So, you are suggesting sieving to just 40,000 then again to 100G and it will fit into 485Mb? Just making sure I've got it right.

2010-06-07, 18:16   #9
Oddball

May 2010

499 Posts

Quote:
 Originally Posted by Flatlander You saved me a job. I was about to do some tests. So, you are suggesting sieving to just 40,000 then again to 100G and it will fit into 485Mb? Just making sure I've got it right.
The default option for NewPGen is to sieve to 1G, then to 100G. I don't know whether it's possible to change it to what you were suggesting.

 2010-06-07, 18:35 #10 Flatlander I quite division it     "Chris" Feb 2005 England 31·67 Posts I meant run it once to 40,000 then manually load it again to 100G.
2010-06-07, 19:20   #11
henryzz
Just call me Henry

"David"
Sep 2007
Cambridge (GMT/BST)

5·1,187 Posts

Quote:
 Originally Posted by Flatlander You saved me a job. I was about to do some tests. So, you are suggesting sieving to just 40,000 then again to 100G and it will fit into 485Mb? Just making sure I've got it right.
That should work. Once each bit is sieved upto the limit set(in Options|Sieve Until in windows) they will be comibined into one file which should be in theory small enougth to fit into 485Mb. I haven't tested this although I have done something like this to combine early(not really early like this) before so I know that bit works. It's the 485Mb bit that I am not so certain over. It depends whether the memory usage is just number of candidates or if it is also effected by distance between candidates etc.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post Xyzzy Hardware 851 2021-08-24 05:08 joblack Hardware 284 2020-12-29 03:54 Oddball Riesel Prime Search 5 2010-08-02 00:11 axn Sierpinski/Riesel Base 5 25 2010-05-28 23:57 Citrix Prime Sierpinski Project 15 2005-08-29 13:56

All times are UTC. The time now is 03:37.

Sat Nov 27 03:37:16 UTC 2021 up 126 days, 22:06, 0 users, load averages: 1.14, 1.23, 1.19

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.