mersenneforum.org  

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

Reply
 
Thread Tools
Old 2021-01-16, 07:45   #287
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

22·32·17 Posts
Default

If I run sr1sieve version 1.4.5
sr1sieve_1.4.5-x86_64-linux -P 15257050000000000 -i in -o out -f factor1.txt)

I get an out file with this format:
Code:
15257500000000000:M:1:10:258
92 1400033
92 1400035
92 1400045
92 1400068
92 1400075
...
If I run version 1.4.7
sr1sieve_1.4.7_aarch64 -P 15257050000000000 -i in -o out -f factor1.txt
I get an out file with this format:
Code:
ABCD 92*10^$a-1 [1400033] // Sieved to 15257500000000000
2
10
23
...
How to get in 1.4.7 the same output format as in 1.4.5?
Background is that I run a task on different hosts and compare the results afterwards to ensure valid results.
yoyo is online now   Reply With Quote
Old 2021-01-16, 08:02   #288
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

222318 Posts
Default

You may have some options (was it -w or -G? I don't recall) to convert file formats, or you also can call srfile after the run, to convert to pfgw format, or newpgen format, or any format.

edit: I only have 1.4.5 here, you can call "srfile -g second_file" to get the "first_file" (i.e. convert from abc format to newpgen format). For details, see "srfile -h" and "sr1sieve -h".

Last fiddled with by LaurV on 2021-01-16 at 08:11
LaurV is offline   Reply With Quote
Old 2021-03-10, 18:54   #289
bur
 
Aug 2020

2×47 Posts
Default

Does sr1sieve support Riesel and Proth numbers in the same sieve? I combined two seperate sieves using srfile and sr1sieve threw the error
Code:
Cannot support multiple sequences in input file `sr_2.abcd'.
I guess that means, no?


I wanted to use it since it was the fastest among sr1sieve, sr2sieve and srsieve2 for my fixed k.


Does it even make sense efficiency-wise to combine sieve files like that or would it be the same if I ran them seperately?
bur is offline   Reply With Quote
Old 2021-03-10, 19:12   #290
Happy5214
 
Happy5214's Avatar
 
"Alexander"
Nov 2008
The Alamo City

23×71 Posts
Default

sr1sieve doesn't support multiple sequences period. It's optimized for a single sequence (i.e. k). The traditional rule of thumb is to use sr2sieve for 3 or more k's, sr1sieve for 1 or 2 (two separate instances in the latter case), and srsieve/srsieve2 just to start (I go to 1e9 because my workflow is highly automated by e9, but that's probably not optimal), but I think srsieve2cl (GPU, not srsieve2 for CPU) is faster than even sr1sieve for a single k.

Last fiddled with by Happy5214 on 2021-03-10 at 19:13 Reason: Clarify
Happy5214 is offline   Reply With Quote
Old 2021-03-10, 19:35   #291
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

6,277 Posts
Default

Quote:
Originally Posted by bur View Post
Does sr1sieve support Riesel and Proth numbers in the same sieve? I combined two seperate sieves using srfile and sr1sieve threw the error
Code:
Cannot support multiple sequences in input file `sr_2.abcd'.
I guess that means, no?


I wanted to use it since it was the fastest among sr1sieve, sr2sieve and srsieve2 for my fixed k.


Does it even make sense efficiency-wise to combine sieve files like that or would it be the same if I ran them seperately?
sr1sieve cannot be modified to sieve both +1 and -1 for the same k/b concurrently. The sign is important WRT how the Legendre tables are built and used.
rogue is offline   Reply With Quote
Old 2021-03-12, 11:59   #292
bur
 
Aug 2020

2·47 Posts
Default

Generally it's adviced to sieve the whole set of candidates in one sieve as computation time increases only with the sqrt of the number of candidates. But does this rule still apply in the case of +1 and -1 combined?

If not, then sr1sieve run on two seperate sieves would be more efficient.

I cannot test it right now as I don't have access to the computer.



Quote:
but I think srsieve2cl (GPU, not srsieve2 for CPU) is faster than even sr1sieve for a single k.
Do you know if that's the software PG uses for their Proth Prime Sieves? I tried that on a GTX 730 and it was very slow, likely due to the old card, but it's the only one I have available for sieving.

Last fiddled with by bur on 2021-03-12 at 12:01
bur is offline   Reply With Quote
Old 2021-03-16, 18:58   #293
Gelly
 
Gelly's Avatar
 
May 2020

5·7 Posts
Default

Code:
../srsieve2cl -P 5e13 -i candy2.cand -o candy.cand -f A -W 4 -G 1
srsieve2cl v1.5.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n
Sieving one sequence where abs(c) = 1 for p >= 15175098061843
Split 1 base 13 sequence into 19 base 13^120 sequences.
551218 bytes used for congruence tables
351 bytes used for Legendre tables
*** buffer overflow detected ***: terminated
Aborted (core dumped)
srsieve2cl is crying. Perhaps I am missing the exact methodology to run the siever with OpenCL, but it seems like any attempt to introduce a GPU worker with -G 1 causes a buffer overflow. GPU is an RTX 2070.
Gelly is offline   Reply With Quote
Old 2021-03-16, 19:26   #294
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

6,277 Posts
Default

Quote:
Originally Posted by Gelly View Post
Code:
../srsieve2cl -P 5e13 -i candy2.cand -o candy.cand -f A -W 4 -G 1
srsieve2cl v1.5.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n
Sieving one sequence where abs(c) = 1 for p >= 15175098061843
Split 1 base 13 sequence into 19 base 13^120 sequences.
551218 bytes used for congruence tables
351 bytes used for Legendre tables
*** buffer overflow detected ***: terminated
Aborted (core dumped)
srsieve2cl is crying. Perhaps I am missing the exact methodology to run the siever with OpenCL, but it seems like any attempt to introduce a GPU worker with -G 1 causes a buffer overflow. GPU is an RTX 2070.
It hasn't started any workers yet. I'm guessing that srsieve2 will fail at the same point. Please post or e-mail your input file and I'll take a look.
rogue is offline   Reply With Quote
Old 2021-03-17, 11:55   #295
Gelly
 
Gelly's Avatar
 
May 2020

5×7 Posts
Default

Here's the list of candidates. I have been running it under srsieve2 (and, indeed, even with srsieve2cl with no GPU workers) with no issues, so I do think it's a GPU error on my end.
Attached Files
File Type: txt candy2.txt (36.4 KB, 9 views)
Gelly is offline   Reply With Quote
Old 2021-03-17, 12:29   #296
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

6,277 Posts
Default

I did find one bug in CisOneWithOneSequenceHelper.cpp and committed a fix, but that bug prevented compilation on OS X. The sequence in this file works on two different GPUs that I've tried, one AMD and one NVIDIA.

If you get the updated file and rebuild (start with make clean), are you able to do any debugging?

Have you run any of the other GPU-enabled sievers built on the framework? Do any of those work?
rogue is offline   Reply With Quote
Old 2021-03-17, 18:47   #297
Gelly
 
Gelly's Avatar
 
May 2020

3510 Posts
Default

Quote:
Originally Posted by rogue View Post
I did find one bug in CisOneWithOneSequenceHelper.cpp and committed a fix, but that bug prevented compilation on OS X. The sequence in this file works on two different GPUs that I've tried, one AMD and one NVIDIA.

If you get the updated file and rebuild (start with make clean), are you able to do any debugging?

Have you run any of the other GPU-enabled sievers built on the framework? Do any of those work?
Did what you suggested. Still no dice for srsieve2cl. It seems like most of the other cl sievers work just fine with OpenCL, though I did not make a decimal file for pixsievecl to test with.

Here's another example where I start sieving on a random sequence, leading me to believe it's not a sequence problem, neither:

Code:
../srsieve2cl -G 1 -P 1e13 -n 1000 -N 1500 -s "2564*2345^n+1"
srsieve2cl v1.5.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n
Sieving with generic logic for p >= 3
Creating CPU worker to use until p >= 1000000
GPU primes per worker is 56320
Sieve started: 3 < p < 1e13 with 501 terms (1000 < n < 1500, k*2345^n+c) (expecting 482 factors)
Sieving one sequence where abs(c) = 1 for p >= 2564
Split 1 base 2345 sequence into 11 base 2345^30 sequences.
552614 bytes used for congruence tables
376119 bytes used for Legendre tables
Creating CPU worker to use until p >= 1000000
*** buffer overflow detected ***: terminated
Aborted (core dumped)
Gelly is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sieving twins with srsieve henryzz Twin Prime Search 0 2014-03-18 12:44
Intel announces multi-core enhancements for Haswell chips ixfd64 Hardware 8 2012-02-10 20:32
LLRnet enhancements kar_bon No Prime Left Behind 10 2008-03-28 11:21
TODO list and suggestions/comments/enhancements Greenbank Octoproth Search 2 2006-12-03 17:28
Suggestions for future enhancements Reboot It Software 16 2003-10-17 01:31

All times are UTC. The time now is 16:44.

Tue Apr 13 16:44:04 UTC 2021 up 5 days, 11:24, 1 user, load averages: 4.27, 4.28, 4.18

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.