mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2006-12-08, 02:15   #45
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13·89 Posts
Default

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 here.
geoff is offline   Reply With Quote
Old 2006-12-08, 05:04   #46
Citrix
 
Citrix's Avatar
 
Jun 2003

1,571 Posts
Default

Quote:
Originally Posted by geoff View Post
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 here.
That is impressive. Have you tried your program for PSP's dat?
Citrix is online now   Reply With Quote
Old 2006-12-08, 07:57   #47
tcadigan
 
tcadigan's Avatar
 
Sep 2004
UVic

10001102 Posts
Default

Quote:
Originally Posted by geoff View Post
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 here.
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!
tcadigan is offline   Reply With Quote
Old 2006-12-08, 08:07   #48
S485122
 
S485122's Avatar
 
Sep 2006
Brussels, Belgium

1,571 Posts
Default

Quote:
Originally Posted by geoff View Post
If anyone wants to try out sr2sieve, there are some binaries here.
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...
S485122 is offline   Reply With Quote
Old 2006-12-08, 08:17   #49
Xentar
 
Xentar's Avatar
 
Sep 2006

2·3·31 Posts
Default

Quote:
Originally Posted by geoff View Post
sr2sieve-1.4.9-linux32-i686: 340 kp/s
here.
Is sr2sieve right? Shouldn´t it be sr4sieve, or something like that?

Last fiddled with by Xentar on 2006-12-08 at 08:17
Xentar is offline   Reply With Quote
Old 2006-12-08, 16:00   #50
thommy
 

7,411 Posts
Default

Quote:
Originally Posted by Xentar View Post
Is sr2sieve right? Shouldn´t it be sr4sieve, or something like that?
a*4^b+1=a*2^(2*b)+1

and thats the form which is sieved i think
  Reply With Quote
Old 2006-12-08, 19:43   #51
Xentar
 
Xentar's Avatar
 
Sep 2006

2·3·31 Posts
Default

Quote:
Originally Posted by thommy View Post
a*4^b+1=a*2^(2*b)+1

and thats the form which is sieved i think
ok, thats possible - didnt think about that, sry.
But then, we would need another input file, because of 2*b, right?

Last fiddled with by Xentar on 2006-12-08 at 19:47
Xentar is offline   Reply With Quote
Old 2006-12-09, 08:40   #52
thommy
 

1D7416 Posts
Default

sure. but thats taken care of.
  Reply With Quote
Old 2006-12-10, 22:45   #53
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

48516 Posts
Default

Quote:
Originally Posted by Jacob Visser View Post
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...
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?
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?
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).
geoff is offline   Reply With Quote
Old 2006-12-10, 23:39   #54
Citrix
 
Citrix's Avatar
 
Jun 2003

110001000112 Posts
Default

I think once you implement the SPH algorithm, your program should be faster than proth_sieve. Any plans to implement SPH algorithm?
Citrix is online now   Reply With Quote
Old 2006-12-11, 00:02   #55
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13·89 Posts
Default

Quote:
Originally Posted by Citrix View Post
I think once you implement the SPH algorithm, your program should be faster than proth_sieve. Any plans to implement SPH algorithm?
Is this post 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.
geoff is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sierpinski/Riesel Base 5: Post Primes Here robert44444uk Sierpinski/Riesel Base 5 358 2008-12-08 16:28
Sierpinski/Riesel Base 10 rogue Conjectures 'R Us 11 2007-12-17 05:08
Sierpinski / Riesel - Base 23 michaf Conjectures 'R Us 2 2007-12-17 05:04
Sierpinski / Riesel - Base 22 michaf Conjectures 'R Us 49 2007-12-17 05:03
Sierpinski Base 5 Reservations geoff Sierpinski/Riesel Base 5 2 2006-08-29 18:23

All times are UTC. The time now is 20:01.

Tue Sep 22 20:01:45 UTC 2020 up 12 days, 17:12, 0 users, load averages: 1.61, 1.79, 1.79

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.