mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2019-10-18, 15:13   #254
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

5,717 Posts
Default

I have committed a number of code changes to sourceforge to address the reported issues. The changes are not fully tested, but I think the reported issues are fixed. I haven't updated the distribution yet. I will do that as soon as I can.
rogue is offline   Reply With Quote
Old 2019-10-22, 17:24   #255
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

165516 Posts
Default

I tracked down the memory leak in srsieve2. It was caused by an overloaded operator that was using a copy constructor.
rogue is offline   Reply With Quote
Old 2019-10-27, 00:49   #256
Citrix
 
Citrix's Avatar
 
Jun 2003

2·773 Posts
Default

I am interested in low weight numbers of the form k*b^n+-1 with fixed k and b and variable n. (srsieve2.exe)

Is it possible to add support for large bases where b'=b^x and large k values where k'=k*b^y

where b is small <100
and b' is greater than 2^64

Currently the program does not automatically convert k*b^n+-1 to k'*b'^n+-1 to increase speed.

Thanks.

Last fiddled with by Citrix on 2019-10-27 at 01:33
Citrix is offline   Reply With Quote
Old 2019-10-27, 12:47   #257
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

5,717 Posts
Default

Quote:
Originally Posted by Citrix View Post
I am interested in low weight numbers of the form k*b^n+-1 with fixed k and b and variable n. (srsieve2.exe)

Is it possible to add support for large bases where b'=b^x and large k values where k'=k*b^y

where b is small <100
and b' is greater than 2^64

Currently the program does not automatically convert k*b^n+-1 to k'*b'^n+-1 to increase speed.

Thanks.
If I understand correctly, you want k*b^y*(b^x)^n+-1. Since this is k*b^(y+x*n)+-1, as long as k < 2^63, you can start with srsieve2, but then use a scripting language to eliminate all candidates that you don't fit. Could also also generate your input candidate file then start sieving from p=3.

Am I missing something?
rogue is offline   Reply With Quote
Old 2019-10-27, 15:20   #258
Citrix
 
Citrix's Avatar
 
Jun 2003

2×773 Posts
Default

Quote:
Originally Posted by rogue View Post
If I understand correctly, you want k*b^y*(b^x)^n+-1.

Am I missing something?
Yes this is correct.

For a range of n=1 to 1000000 the discrete log would have 1000 BS and 1000 GS
If we know x =16
Then the range becomes n=1 to 62500 (for base b^16) and the discrete log would have 250 BS and 250 GS
4 times faster.

For extremely low weights (that I am working with) where x can be close to 10000 the program can be made significantly faster. (~100 times)

Currently the program does not automatically detect the pattern and calculate the value of x.

(To calculate x you just need the gcd of the difference of all the consecutive candidates left in the sieve. You can do this just once at the start of the sieve).

Thanks.

Last fiddled with by Citrix on 2019-10-27 at 15:22
Citrix is offline   Reply With Quote
Old 2019-10-27, 20:52   #259
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT)

566110 Posts
Default

Quote:
Originally Posted by Citrix View Post
Yes this is correct.

For a range of n=1 to 1000000 the discrete log would have 1000 BS and 1000 GS
If we know x =16
Then the range becomes n=1 to 62500 (for base b^16) and the discrete log would have 250 BS and 250 GS
4 times faster.

For extremely low weights (that I am working with) where x can be close to 10000 the program can be made significantly faster. (~100 times)

Currently the program does not automatically detect the pattern and calculate the value of x.

(To calculate x you just need the gcd of the difference of all the consecutive candidates left in the sieve. You can do this just once at the start of the sieve).

Thanks.
The old srxsieve programs will cope with that as they will sieve sub-sequences when only a few remain. This results in a huge speedup for low weight sequences. This is a feature than mtsieve should have if it doesn't already(I haven't used the srsieve2 yet so I don't know)

Last fiddled with by henryzz on 2019-10-27 at 20:53
henryzz is offline   Reply With Quote
Old 2019-10-27, 22:21   #260
Citrix
 
Citrix's Avatar
 
Jun 2003

110000010102 Posts
Default

Quote:
Originally Posted by henryzz View Post
The old srxsieve programs will cope with that as they will sieve sub-sequences when only a few remain. This results in a huge speedup for low weight sequences. This is a feature than mtsieve should have if it doesn't already(I haven't used the srsieve2 yet so I don't know)
Srxsieve also misses this at times. As it only looks at x=factors of 720.
Citrix is offline   Reply With Quote
Old 2019-12-11, 23:12   #261
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

124910 Posts
Default Twinsieve and CPU utilization

As you know I do many jobs with your twinsieve. Since I buy new 6 core CPU I noticed something I was not sow on 4 core CPU.
If I run sieve from start somewhere up to 2e15 I can get nearly 96% of CPU usage on 6 core CPU . But if I run it from 2e16 to 4e16 then I cannot get more then 45% of CPU usage. I can increase "W" option and can get around 62% of CPU usage but that is all I can get.
I assume on higher sieve depth CPU do less job since there is smaller number of primes to test, but how to get at least 90% of CPU usage on those, higher sieve depth? I try to increase worker number from 6 to 8 but that doesnot help.
Any other suggestion?
pepi37 is offline   Reply With Quote
Old 2019-12-12, 13:53   #262
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

165516 Posts
Default

Quote:
Originally Posted by pepi37 View Post
As you know I do many jobs with your twinsieve. Since I buy new 6 core CPU I noticed something I was not sow on 4 core CPU.
If I run sieve from start somewhere up to 2e15 I can get nearly 96% of CPU usage on 6 core CPU . But if I run it from 2e16 to 4e16 then I cannot get more then 45% of CPU usage. I can increase "W" option and can get around 62% of CPU usage but that is all I can get.
I assume on higher sieve depth CPU do less job since there is smaller number of primes to test, but how to get at least 90% of CPU usage on those, higher sieve depth? I try to increase worker number from 6 to 8 but that doesnot help.
Any other suggestion?
I'm guessing the bottleneck is where it gets the next block of primes for testing as only one thread can get a block of primes at a time. I don't have any great ideas as to how to address that right now.

One option would be to run two instances across two different ranges of primes, saving the factors (-O) then using -I to remove terms from the original input file.
rogue is offline   Reply With Quote
Old 2020-01-12, 11:15   #263
rebirther
 
rebirther's Avatar
 
Sep 2011
Germany

1001001110112 Posts
Default

@rogue: Is there any progress for the srsieve2 prp output format. I could really need it.
rebirther is offline   Reply With Quote
Old 2020-01-12, 18:05   #264
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

5,717 Posts
Default

Quote:
Originally Posted by rebirther View Post
@rogue: Is there any progress for the srsieve2 prp output format. I could really need it.
(going off of memory here) I think this is the -fB option. Can you verify that it exists in the latest released version and if it does, if that is what you are looking for?
rogue is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 08:52.

Sat Jun 6 08:52:04 UTC 2020 up 73 days, 6:25, 0 users, load averages: 1.21, 1.48, 1.45

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.