20221204, 13:24  #804 
May 2004
FRANCE
2·307 Posts 
Does the static binary work for you?

20221204, 15:14  #805  
Dec 2011
After milion nines:)
3·541 Posts 
Quote:
Using trick with libsleep.I can reduce it to 50% of one CPU core. Speed is same as Ryzen7 3700x per core: since both need around 17 minutes for test of 535000 digits candidate Quote:


20221204, 20:51  #806 
Jun 2003
1605_{10} Posts 
I am getting the following error. What settings do I need to change?
Code:
srsieve2cl.exe i sr_2.abcd W4 p 10000000000000 P 11000000000000 Ofactors.txt osr_2_new.abcd G12 M100000 l1000 srsieve2cl v1.6.5, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with multisequence c=1 logic for p >= 10000000000000 BASE_MULTIPLE = 2, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720 Assertion failed: m <= HASH_MAX_ELTS, file sierpinski_riesel/AbstractSequenceHelper.cpp, line 272 
20221204, 21:59  #807  
"Mark"
Apr 2003
Between here and the
2×7^{2}×71 Posts 
Quote:


20221204, 22:05  #808 
Jun 2003
3×5×107 Posts 
I get with new
Code:
srsieve2cl.exe i sr_2.abcd W2 p 10000000000000 P 11000000000000 Ofactors.txt osr_2_new.abcd M1000 l10000 w1000 G12 srsieve2cl v1.6.5, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with multisequence c=1 logic for p >= 10000000000000 BASE_MULTIPLE = 2, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720 Split 204 base 2 sequences into 9182 base 2^720 sequences. Legendre summary: Approximately 4752 B needed for Legendre tables 204 total sequences 204 are eligible for Legendre tables 0 are not eligible for Legendre tables 204 have Legendre tables in memory 0 cannot have Legendre tables in memory 0 have Legendre tables loaded from files 204 required building of the Legendre tables 17625600 bytes used for congruent subseq indices 1360000 bytes used for congruent subseqs Fatal Error: Must use generic worker if using GPU with multiple sequences by specifying l0 Code:
srsieve2cl.exe i sr_2.abcd W2 p 10000000000000 P 11000000000000 Ofactors.txt osr_2_new.abcd M1000 w1000 G6 srsieve2cl v1.6.5, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Must use generic sieving logic because l was not specified for mutiple sequences Sieving with generic logic for p >= 10000000000000 Split 204 base 2 sequences into 20555 base 2^2880 sequences. bestQ = 2880 yields bs = 6077, gs = 1, sieveLow = 868, sieveRange = 6077 bestQ = 2880 yields bs = 6077, gs = 1, sieveLow = 868, sieveRange = 6077 GPU primes per worker is 57344 Sieve started: 1e13 < p < 11e12 with 134418 terms (2500875 < n < 20000000, k*2^n1) (expecting 427 factors) Increasing worksize to 16000 since each chunk is tested in less than a second OpenCL Error: Out of host memory in call to clEnqueueNDRangeOpenCLKernel kernelName: generic_kernel globalworksize 57344 localworksize 256 Last fiddled with by Citrix on 20221204 at 22:08 
20221205, 03:39  #809  
"Mark"
Apr 2003
Between here and the
2×7^{2}×71 Posts 
Quote:
Using G impacts GPU memory usage, but with that many subsequences I suggest that you use b (a value less than 1.0) to reduce the size of the hash table that the GPU will use. You might also want to use K to split the sequences across multiple chunks. This will require some trial and error on your part. There is no way (that I am aware of) to compute the memory required for a kernel so the code cannot "autotune" these parameters. You cannot use l > 0 with the GPU when you have multiple sequences. srsieve2cl does not support it at this time. I also do not recommend mixing W and G. The factor rate calculation does not work correctly when using both CPU and GPU workers. You can use p10e12 P11e12 if that is easier to read. 

20221205, 18:44  #810 
Random Account
Aug 2009
Not U. + S.A.
2^{3}×3^{2}×5×7 Posts 
@rogue
Q.: Does srsieve2cl generate an exit code when it finishes? Running small sieves from a batch sometimes would fail because I had the M set too low. It was at 3,500. Now, it is 10,000. It varied based on what the k value was. Some k's caused problems and others did not. All used the same values for n, N, and P. 
20221205, 19:24  #811  
"Mark"
Apr 2003
Between here and the
15456_{8} Posts 
Quote:
SEGFAULTs will just give you the command prompt without any of that. If that happens let me know. Last fiddled with by rogue on 20221205 at 19:25 

20221205, 23:41  #812  
Random Account
Aug 2009
Not U. + S.A.
2^{3}·3^{2}·5·7 Posts 
Quote:
For a normal program run and exit, an error code of zero is expected. If there is an error, a nonzero code is returned. Quote:


20221206, 00:09  #813  
"Mark"
Apr 2003
Between here and the
1101100101110_{2} Posts 
Quote:
I do not understand why you care. The error code is not output to the console. 

20221206, 03:34  #814 
Jun 2003
3·5·107 Posts 
@Rogue
I can get the program to work but it is extremely slow without the Legendre tables. Couple of other questions/thoughts 1. I get the following error with the CPU code as well (srsieve2). Can you release a fix. Code:
Assertion failed: m <= HASH_MAX_ELTS, file sierpinski_riesel/AbstractSequenceHelper.cpp, line 272 3. Possible bug: The GPU code seems to crash if the n range is large (~15M); seems to produce false factors if n range is large and LIMIT_BASE is huge. 4. For what type of sequences is it best to use GPU and for which ones should you stick to CPU. Thanks Last fiddled with by Citrix on 20221206 at 04:00 Reason: Sp 