![]() |
|
|
#12 |
|
I quite division it
"Chris"
Feb 2005
England
31·67 Posts |
Okay, thanks. I'll try it with the 0.75T range I have left to do and see how much memory it uses.
|
|
|
|
|
|
#13 | |
|
Jun 2003
23×683 Posts |
Quote:
|
|
|
|
|
|
|
#14 | |
|
I quite division it
"Chris"
Feb 2005
England
81D16 Posts |
Quote:
Sieving from 4e4 to 100G is progressing painfully slowly but of course the first bit is always much slower. I think I'll just stop now and run a whole 1T range, now that I know it will easily fit in 485Mb once sieved to 4e4. I'll post the timings here later. The NPG help file states: "NewPGen is happy with lots of k's to sieve - there is nothing to be gained by dividing a range of k's up and sieving each subrange in turn..." So I'm hoping there will be an increase in efficiency. Last fiddled with by Flatlander on 2010-06-07 at 21:29 |
|
|
|
|
|
|
#15 | |
|
Jun 2003
23·683 Posts |
Quote:
Only true when p >= k range (or maybe range/2). Otherwise there is no increase in efficiency, and might even be slower due to memory pressure (Fast Array vs Normal Array mode). |
|
|
|
|
|
|
#16 |
|
I quite division it
"Chris"
Feb 2005
England
31×67 Posts |
Fair enough.
|
|
|
|
|
|
#17 |
|
Jun 2010
26410 Posts |
|
|
|
|
|
|
#18 |
|
"Dave"
Sep 2005
UK
1010110110002 Posts |
This is in fact the problem with only sieving to p=4e4 in the first stage. It leaves about 32.5 M k's and therefore NewPGen uses normal array mode. I hadn't worked out why it was so slow until I stopped the sieve at p=1e6. When restarted NewPGen switched to fast array mode and the removal rate jumped from 40 k/sec to 280 k/sec, If there is an advantage (yet to be proven), then the first stage needs to sieve to much closer to p=1e6.
|
|
|
|
|
|
#19 |
|
I quite division it
"Chris"
Feb 2005
England
31×67 Posts |
Re. Megabit Twin Sieve
I tried sieving to 10M then again to 100G. The total time was 10-20% slower than letting NPG do it automatically. I would seem that indeed the 'sweet spot' is above 1G. Some scribbled timings: Start to 10M took 15hrs 3m (Leaving 6.1M ks.) Started NPG again. (Used fast array, 384Mb ram.) 10M-20M took 1hr 24m 20m-100m took 4hrs 25m 100m-500m took 2hrs 41m 500m-100G to 8hrs 33m Total time c. 32hrs compared with c. 26-28 hrs (iirc) letting NPG do it automatically. C2Quad Q6700 at stock 2.66GHz. 2Gb ram, NPG memory at maximum 485Mb. Last fiddled with by Flatlander on 2010-06-11 at 23:27 Reason: Clarification. |
|
|
|
|
|
#20 | |
|
Jun 2003
10101010110002 Posts |
Quote:
I am asking because I am "fairly confident" that I can write a custom sieve that can sieve a range of k's to 1e6 (or even 10e6) much faster than NewPGen can. NewPGen isn't really optimised for the initial sieving. |
|
|
|
|
|
|
#21 |
|
Jun 2003
125308 Posts |
|
|
|
|
|
|
#22 | ||
|
I quite division it
"Chris"
Feb 2005
England
31·67 Posts |
Quote:
Quote:
All figures subject to slight variation as NPG had high priority while 4 x LLRNet with low priority were running in the background. (So I didn't waste any cycles when NPG finished overnight.) |
||
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Perpetual benchmark thread... | Xyzzy | Hardware | 897 | 2023-06-15 13:46 |
| Hardware Benchmark Jest Thread for 100M exponents | joblack | Hardware | 285 | 2022-08-06 21:50 |
| LLR benchmark thread | Oddball | Riesel Prime Search | 5 | 2010-08-02 00:11 |
| sr5sieve Benchmark thread | axn | Sierpinski/Riesel Base 5 | 25 | 2010-05-28 23:57 |
| New Sieve Thread Discussion | Citrix | Prime Sierpinski Project | 15 | 2005-08-29 13:56 |