SR2sieve

[geoff]

Actually Proth_sieve and JJsieve can read them in either order. It was the previous program that required the pmax line first, so of course everyone has continued to have it first.

It is fixed in sr2sieve 1.6.12: pmax is written first but reading can be in either order.

[Death]

11/06/07 18:01:16 ERROR: Failed to open input file `sr2data.txt'.

what's this???

[Death]

oh well it works only with -j -s order
not with -s -j

strange....

[Death]

sr2sieve 1.6.12 -- A sieve for multiple sequences k*b^n+/-1 and b^n+/-k.
Compiled on Nov 2 2007 with GCC version 3.4.5 (mingw special).
SSE2 code path, L1 data cache 16Kb (detected), L2 cache 2048Kb (detected).
Read 2135444 terms for 17 sequences from dat format file `SoB.dat'.
Split 17 base 2 sequences into 169 base 2^360 subsequences.
Continuing with range pmin=1272000000000000,pmax=1272210000000000 in `SoBStatus.
dat'.
Resuming from checkpoint pmin=1272103091251393 in `SoBStatus.dat'.
Using 16 Kb for the baby-steps giant-steps hashtable, maximum density 0.58.
Best time for baby step method sse2/2: 295856.
Best time for baby step method sse2/4: 292112.
Best time for baby step method sse2/8: 185584.
Best time for baby step method sse2/16: 168864.
Best time for baby step method gen/2: 364160.
Best time for baby step method gen/4: 238640.
Best time for baby step method gen/8: 183776.
Best time for giant step method sse2/2: 147264.
Best time for giant step method sse2/4: 118864.
Best time for giant step method sse2/8: 107760.
Best time for giant step method sse2/16: 104640.
Best time for giant step method gen/2: 175520.
Best time for giant step method gen/4: 167888.
Best time for giant step method gen/8: 136576.
Best time for ladder method sse2/2: 22576.
Best time for ladder method sse2/4: 17808.
Best time for ladder method sse2/8: 10640.
Best time for ladder method sse2/16: 9040.
Best time for ladder method gen/2: 29104.
Best time for ladder method gen/4: 16528.
Best time for ladder method gen/8: 11232.
Best time for ladder method add/1: 26240.
Baby step method sse2/16, giant step method sse2/16, ladder method sse2/16.
BSGS range: 384*362 - 4790*29.
Using 1024Kb for the Sieve of Eratosthenes bitmap.
Expecting to find factors for about 10.14 terms in this range.
sr2sieve started: 991 <= n <= 49999997, 1272103091251393 <= p <= 127221000000000
0
p=1272103110912889, 327435 p/sec, 0 factors, 95.5% cpu, ETA 11 Nov 10:00

should i use -D to search for duplicates?

[Death]

as you can see with P4 3GHz it goes from 200k/sec to 327p/sec
nice!

and with Using 1024Kb - maybe I should give it 2 or 3 Mb? will it go even faster?

[KriZp]

When using the -j switch you shouldn't need to specify the -D switch, as per http://mersenneforum.org/showpost.ph...&postcount=394 factexcl.txt will be written unless -D is used.

[geoff]

oh well it works only with -j -s order not with -s -j

It should work in either order.

and with Using 1024Kb - maybe I should give it 2 or 3 Mb? will it go even faster?

1024Kb is the size of the bitmap used for the Sieve of Eratosthenes which takes only a small part of the program's time, increasing it will probably only have a very small effect, but it will probably slow down if you increase it too far. The default is based on half L2 cache size, and the optimum might depend on what other processes on your system need L2 cache: on multi-core systems is might even be better to reduce the size instead. (Use the -L switch to override the detected L2 cache size).

[Death]

they should, but in my case it starts only with js not sj =((

well, this is a work box, so when I'm at home it works only for sieveng, so I suppose it uses L2 completely.