mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Sierpinski/Riesel Base 5

Reply
 
Thread Tools
Old 2006-05-29, 23:32   #1
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13·89 Posts
Default srsieve windows binaries

I have compiled some Windows binaries, the i586 version should run on anything newer then a 486, the i686 version has the CMOV optimisations.

I have compiled these from Linux using a mingw32 cross-compiler, I briefly tested them on windows xp and there seems to be a problem with the clock function, but works otherwise. It may take me a little while to fix this as there is a lag of a day between compiling and testing. (my testing machine is the local library computer :-)

Please report any other bugs, including usability problems. When we can go a week without a bug report I will call this version 1.0.

edit: It seems there are more serious problems with the screen output, don't use these for serious work but if anyone can figure out what is going wrong I would appreciate it. The main program seems to be working, but the screen output is nonsense :-(

Last fiddled with by geoff on 2006-05-29 at 23:46
geoff is offline   Reply With Quote
Old 2006-05-30, 02:26   #2
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

48516 Posts
Default

The message above refers to version 0.1.9. The problem was printf not printing 64 bit values correctly, I have fixed it in version 0.1.10.

If the moderators want to delete this message and the one above that would be fine with me :-) If not then please ignore the mess above and read the next post.
geoff is offline   Reply With Quote
Old 2006-05-30, 02:42   #3
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13·89 Posts
Default Working srsieve windows binaries

I have compiled srsieve Windows binaries, the i586 version should work on any machine newer than a 486, the i686 version has the CMOV optimisations.

I have tested them for a whole ten minutes on Windows xp, so please report any bugs or anything that just doesn't look right. If a week goes by without a bug report then I will call it version 1.0 and you will be stuck with it :-)

srsieve has been reasonably well tested for base 5 data on Linux, I am using it full time and checking the results, it hasn't produced any false negatives or positives. I don't have an easy way to test it on other platforms, so any help will be much appreciated.
geoff is offline   Reply With Quote
Old 2006-05-30, 21:04   #4
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

Is it any quicker then NewPGen, and if so, how much?
michaf is offline   Reply With Quote
Old 2006-05-31, 23:30   #5
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13×89 Posts
Default

Quote:
Originally Posted by michaf
Is it any quicker then NewPGen, and if so, how much?
For sieving one candidate at a time it is a little quicker then NewPGen, about 25%-50% depending on size of p and hardware.

For sieving with multiple candidates (which NewPGen can't do) it is much faster. Sieving four times more candidates in srsieve only increases the time taken by a factor of two.
geoff is offline   Reply With Quote
Old 2006-06-01, 00:17   #6
tcadigan
 
tcadigan's Avatar
 
Sep 2004
UVic

2·5·7 Posts
Default

I've been using JJsieve for sierpinski base 4 candidates...how does srsieve compare? sorry haven't had resources to check for myself...

Thanks~
tcadigan is offline   Reply With Quote
Old 2006-06-01, 00:30   #7
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13×89 Posts
Default

Quote:
Originally Posted by tcadigan
I've been using JJsieve for sierpinski base 4 candidates...how does srsieve compare? sorry haven't had resources to check for myself...
I think jjsieve is for base 2^n only, but I may be wrong, I can't find the source anywhere to check.

My comparison of srsieve vs NewPGen speed was for base 5, NewPGen may well be faster for base 2^n.
geoff is offline   Reply With Quote
Old 2006-06-07, 03:06   #8
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13·89 Posts
Default

I've posted P4 and Athlon binaries for version 0.1.15, let me know if there are other variations I should make.

Version 0.1.15 contains some base-5 specific code, the 64 bit sieve seems to be more than 30% faster on my P4 when sieving base 5 numbers, but only about 10% faster on my P3.

If anyone is able to compare version 0.1.14 with 0.1.15 on an AMD machine for base 5 sieving I would be interested to know how much faster it is. (I suspect it will be closer to 10% than 30% though).
geoff is offline   Reply With Quote
Old 2006-06-08, 21:18   #9
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

On my P4, the sieve went from about 5500 p/sec to about 7100 p/sec
(on 5.2M candidates)

very impressive!! thank :)
michaf is offline   Reply With Quote
Old 2006-06-09, 02:27   #10
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

22058 Posts
Default

Quote:
Originally Posted by michaf
On my P4, the sieve went from about 5500 p/sec to about 7100 p/sec
(on 5.2M candidates)
I think the reason the P4 gets the best improvement is that it is not well suited to the current FPU based assembler routines. The base-specific code doesn't use the FPU.
geoff is offline   Reply With Quote
Old 2006-06-09, 20:26   #11
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

Ah... so I get a lot of improvement because my processor s*cks :>

To move efficiently, I'd be doing only prp-ing on that processor, and let the sieving being handled by someone else?
michaf is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
srsieve/sr2sieve enhancements rogue Software 281 2020-09-29 16:36
Mac Os X binaries ValerieVonck Software 6 2012-05-15 20:27
Nonstandard lasieve binaries fivemack Factoring 8 2010-04-27 18:59
Binaries for 64-bit windows smh Programming 31 2008-09-03 09:18
Need binaries for Solaris x64 rgiltrap Software 4 2006-04-27 06:55

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

Fri Oct 23 03:54:21 UTC 2020 up 43 days, 1:05, 0 users, load averages: 1.61, 1.68, 1.60

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.