![]() |
![]() |
#34 | |
Aug 2007
Princeton, NJ
A16 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#35 | |
Mar 2003
New Zealand
22058 Posts |
![]() Quote:
On a fast machine sr2sieve usually does thousands of iterations per timeslice, so setting affinity to a particular core isn't necessary if each core is identical. (It shouldn't hurt performance much if sr2sieve gets each timeslice on a different core). |
|
![]() |
![]() |
![]() |
#36 |
Jan 2007
7 Posts |
![]()
I just finished porting the latest sr2sieve (1.7.9) to Haiku (http://haiku-os.org) this morning - and now I need to test it out...
What's the preferred method for testing a sieve client? Is there a good well-known range to test with? I suppose I could just choose a random range, test it on linux, and then test it on Haiku. Considering I have both OSes on the same P4 2.8ghz, I can do a good performance comparison as well (since Haiku is pre-alpha, unoptimized, and uses gcc2.95.3 - i'm guessing there is likely to be a noticeable difference :P ) Anyhow, any suggestions? |
![]() |
![]() |
![]() |
#37 | |
A Sunny Moo
Aug 2007
USA (GMT-5)
186916 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
![]() |
#38 |
Jan 2007
7 Posts |
![]()
Thanks!
In the meantime I just reserved a 10G range and have it running under Linux currently. Once that is done, I'll run it on the Haiku client I built and see how it compares. I'll definitely take a look at the sr5check though when I get a chance! |
![]() |
![]() |
![]() |
#39 |
Jan 2007
7 Posts |
![]()
Woohoo! This client is slow as molasses :P (the linux client on the same machine is 5-6x faster)
Probably because I compiled it with USE_ASM=no - I didn't really investigate why the ASM fails to compile, but I suspect it's simply because I am compiling with gcc2.95.3. Soon Haiku should have a native gcc4 toolchain as well, and then I can give it another go to see how that works. Otherwise the client appears to be working OK :) Last fiddled with by umccullough on 2008-04-01 at 09:06 |
![]() |
![]() |
![]() |
#40 |
Dec 2004
29910 Posts |
![]()
look for a new dat should provide a little speed bump let us know how much, i havn't had a good chance to test the speed increase.
|
![]() |
![]() |
![]() |
#41 |
Feb 2008
5 Posts |
![]()
I'm using the BOINC client to run sr2sieve on three different computers. It appears to me that there is no decrease in the time it takes to sieve 0.5 GB. In fact, I've measured a very slight increase. Based on a post I found elsewhere, I think the speed increase should be approximately 1-sqrt(16/17)=3% but I'm not seeing it. There is some variability in the sieving times so maybe I've just had bad luck lately (or something). I'm not too worried about it but I'd be interested in what other people are seeing.
|
![]() |
![]() |
![]() |
#42 |
Dec 2006
3×11 Posts |
![]()
Then you run primegrid? See this post: http://www.primegrid.com/forum_threa...wrap=true#8675
The work unit range has been increased from 0.5 to no idea to get appriximately same runtimes. So its not that easy to compare. |
![]() |
![]() |
![]() |
#43 |
Feb 2008
516 Posts |
![]()
Oh, you're right. That seems needlessly confusing. I guess I'd have to run sr2sieve manually to make a comparison. Maybe I'll do that.
|
![]() |
![]() |
![]() |
#44 |
Feb 2008
5 Posts |
![]()
Sieving 1G with the old and new dat files on a 1.5GHz P-4 resulted in a 3.5% speedup. If the k=265711 sequence was typical, I think this means we will actually see a 2.6% slowdown in finding factors.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
srsieve/sr2sieve enhancements | rogue | Software | 287 | 2021-01-16 08:02 |
32-bit of sr1sieve and sr2sieve for Win | pepi37 | Software | 5 | 2013-08-09 22:31 |
sr2sieve question | SaneMur | Information & Answers | 2 | 2011-08-21 22:04 |
How to use sr2sieve | nuggetprime | Riesel Prime Search | 40 | 2007-12-03 06:01 |
Sr2sieve on PPC/Linux | BlisteringSheep | Sierpinski/Riesel Base 5 | 172 | 2007-07-06 21:29 |