mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Conjectures 'R Us (https://www.mersenneforum.org/forumdisplay.php?f=81)
-   -   Sierpinski base 4 (https://www.mersenneforum.org/showthread.php?t=3630)

geoff 2006-12-08 02:15

At p=5e12, the sieve speed for a P2/400 running Linux is:

proth_sieve_cmov 0.42: 193 kp/s
sr2sieve-1.4.9-linux32-i686: 340 kp/s

If anyone wants to try out sr2sieve, there are some binaries [url=http://www.geocities.com/g_w_reynolds/sr5sieve/tests/]here[/url].

Citrix 2006-12-08 05:04

[QUOTE=geoff;93558]At p=5e12, the sieve speed for a P2/400 running Linux is:

proth_sieve_cmov 0.42: 193 kp/s
sr2sieve-1.4.9-linux32-i686: 340 kp/s

If anyone wants to try out sr2sieve, there are some binaries [url=http://www.geocities.com/g_w_reynolds/sr5sieve/tests/]here[/url].[/QUOTE]

That is impressive. Have you tried your program for PSP's dat?

tcadigan 2006-12-08 07:57

[QUOTE=geoff;93558]At p=5e12, the sieve speed for a P2/400 running Linux is:

proth_sieve_cmov 0.42: 193 kp/s
sr2sieve-1.4.9-linux32-i686: 340 kp/s

If anyone wants to try out sr2sieve, there are some binaries [url=http://www.geocities.com/g_w_reynolds/sr5sieve/tests/]here[/url].[/QUOTE]

ooooo nice!!!
I just ran a quickie....just to see what speed it gives. it's nice big boost^^

at 5500 billion I'm getting 800 kp/s
I don't remember the exact numbers I was getting with jjsieve, but it was something down in the 400-500 range iirc (don't have time to do a full test right now)

this is a 3.2 p4 HT, with a c120 gnfs sieving, and llr for this project picking up the extra cycles. so I would expect that 800 kp/s to jump even higher if I was running just it on my system.

this is awesome because it puts 1000 billion of sieving in reach for 2 weeks +/- a couple days.

great work with your program Geoff! :bow:

S485122 2006-12-08 08:07

[QUOTE=geoff;93558]If anyone wants to try out sr2sieve, there are some binaries [url=http://www.geocities.com/g_w_reynolds/sr5sieve/tests/]here[/url].[/QUOTE]
The files containing the P4 and prescott versions have some problems with extraction.

I do not have these problems with the 1.4.8 versions...

Xentar 2006-12-08 08:17

[QUOTE=geoff;93558]sr2sieve-1.4.9-linux32-i686: 340 kp/s
[url=http://www.geocities.com/g_w_reynolds/sr5sieve/tests/]here[/url].[/QUOTE]

Is sr2sieve right? Shouldn´t it be sr4sieve, or something like that?

thommy 2006-12-08 16:00

[QUOTE=Xentar;93580]Is sr2sieve right? Shouldn´t it be sr4sieve, or something like that?[/QUOTE]

a*4^b+1=a*2^(2*b)+1

and thats the form which is sieved i think

Xentar 2006-12-08 19:43

[QUOTE=thommy;93605]a*4^b+1=a*2^(2*b)+1

and thats the form which is sieved i think[/QUOTE]

ok, thats possible - didnt think about that, sry.
But then, we would need another input file, because of 2*b, right?

thommy 2006-12-09 08:40

sure. but thats taken care of.

geoff 2006-12-10 22:45

[QUOTE=Jacob Visser;93578]The files containing the P4 and prescott versions have some problems with extraction.

I do not have these problems with the 1.4.8 versions...[/QUOTE]
There is some room for confusion here: note that sr2sieve is for base 2 only, sr5sieve is for base 5 only.

File corruption is possible, I use floppy disks to transfer the files before upload :-(

[QUOTE]
Is sr2sieve right? Shouldn´t it be sr4sieve, or something like that?
[/QUOTE]
It might be slightly faster to recompile the program to use base 4 instead, but the files are already in base 2 format so it is probably not worth the effort.

[QUOTE]
That is impressive. Have you tried your program for PSP's dat?
[/QUOTE]
Yes, it is still slower than proth_sieve for PSP. Sr2sieve seems to work better with a small range of n or a large number of k. (But sr2sieve can sieve Sierpinski and Riesel numbers together, so if PSP and Rieselsieve were using the same n range then the difference might be less for a combined sieve).

Citrix 2006-12-10 23:39

I think once you implement the SPH algorithm, your program should be faster than proth_sieve. Any plans to implement SPH algorithm?

geoff 2006-12-11 00:02

[QUOTE=Citrix;93780]I think once you implement the SPH algorithm, your program should be faster than proth_sieve. Any plans to implement SPH algorithm?[/QUOTE]

Is this [url=http://www.mersenneforum.org/showpost.php?p=89333&postcount=2]post[/url] a description of the SPH algorithm?

I have been thinking about how to implement those ideas, but I think it is still quite a lot of work, and I may not have a lot of time to work on the program in 2007.

The source code is there if anyone wants to improve it, or to use it as a base for their own program.


All times are UTC. The time now is 14:55.

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