mersenneforum.org  

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

Reply
 
Thread Tools
Old 2022-07-31, 21:28   #672
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

62716 Posts
Default

e:\MTSIEVE\MTSIEVE-2-3-3>kbbsieve -P 100000 -W1 -k 77 -b 2 -B 200000
kbbsieve v1.1, a program to find factors of k*b^b+c numbers for fixed k and c = +1/-1
199998 even terms removed
Sieve started: 3 < p < 1e5 with 199998 terms (k = 77, 2 <= b <= 200000) (expecting 180913 factors)
CTRL-C accepted. Threads will stop after sieving to 100000
Decreasing worksize to 5024 since each chunk needs more than 5 seconds to test
Sieve completed at p=100003.
CPU time: 10.28 sec. (0.00 sieving) (1.11 cores)
Fatal Error: Something is wrong. Counted terms (22861) != expected terms (22859)
pepi37 is offline   Reply With Quote
Old 2022-08-01, 03:53   #673
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

11010010100002 Posts
Default

Quote:
Originally Posted by pepi37 View Post
e:\MTSIEVE\MTSIEVE-2-3-3>kbbsieve -P 100000 -W1 -k 77 -b 2 -B 200000
kbbsieve v1.1, a program to find factors of k*b^b+c numbers for fixed k and c = +1/-1
199998 even terms removed
Sieve started: 3 < p < 1e5 with 199998 terms (k = 77, 2 <= b <= 200000) (expecting 180913 factors)
CTRL-C accepted. Threads will stop after sieving to 100000
Decreasing worksize to 5024 since each chunk needs more than 5 seconds to test
Sieve completed at p=100003.
CPU time: 10.28 sec. (0.00 sieving) (1.11 cores)
Fatal Error: Something is wrong. Counted terms (22861) != expected terms (22859)
I see what the issue is. A factor is counted when it shouldn't be. The output .pfgw file is correct. I will fix sometime this week.
rogue is offline   Reply With Quote
Old 2022-08-01, 15:41   #674
japelprime
 
japelprime's Avatar
 
"Erling B."
Dec 2005

103 Posts
Default

Maybe this helps pepi37. I was running gfndsievecl. I found that if -g is to low then the CPU will not load any work to GPU. The CPU will do the work without distributing work to GPU. (explains high CPU time and low or no GPU time) when I skip -g command no work goes to GPU because default limit is to low. Not even -g 100 moves the card to workload. When putting -g 200 I start to see the CPU buffering up the extra work to GPU card. From 5% workload for -g 200 to 8% for -g 300. So maybe default -g value should be somehow higher. I used -S 10000
japelprime is offline   Reply With Quote
Old 2022-08-01, 18:09   #675
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

151208 Posts
Default

Quote:
Originally Posted by japelprime View Post
Maybe this helps pepi37. I was running gfndsievecl. I found that if -g is to low then the CPU will not load any work to GPU. The CPU will do the work without distributing work to GPU. (explains high CPU time and low or no GPU time) when I skip -g command no work goes to GPU because default limit is to low. Not even -g 100 moves the card to workload. When putting -g 200 I start to see the CPU buffering up the extra work to GPU card. From 5% workload for -g 200 to 8% for -g 300. So maybe default -g value should be somehow higher. I used -S 10000
You could also try a higher value for -G. I haven't tried that myself.
rogue is offline   Reply With Quote
Old 2022-08-01, 21:10   #676
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

32·52·7 Posts
Default

Quote:
Originally Posted by japelprime View Post
Maybe this helps pepi37. I was running gfndsievecl. I found that if -g is to low then the CPU will not load any work to GPU. The CPU will do the work without distributing work to GPU. (explains high CPU time and low or no GPU time) when I skip -g command no work goes to GPU because default limit is to low. Not even -g 100 moves the card to workload. When putting -g 200 I start to see the CPU buffering up the extra work to GPU card. From 5% workload for -g 200 to 8% for -g 300. So maybe default -g value should be somehow higher. I used -S 10000
I will try this
Thanks!
pepi37 is offline   Reply With Quote
Old 2022-08-14, 13:07   #677
japelprime
 
japelprime's Avatar
 
"Erling B."
Dec 2005

11001112 Posts
Default

I am trying xyyxsievecl. I have some questions.

OpenCL Error: Out of resources
in call to clEnqueueReadBuffer
argument: factorCount

Is this error a driver- old hardware problem or wrong parameter setting ? I am not sure where to look. I did clean driver install.

On command prompt I see "xyyxsieve v1.8" on screen when calling xyyxsievecl version (both versions under same folder)

switch -s b seems not to be working for me here.

When calling xyyxsievecl the program works fine but only for cpu work. -W1 and -W2 are fine but not -G or different -M or any other parameters when I try to effect GPU. Most of the time I get blank screen for 2 second as the card try to start working and then this OpenCL error. When it is stable there is no workrate at GPU when running. I have Geforce GTX 760 card.

The same PC works fine trying gfndsievecl for the gpu part.

Last fiddled with by japelprime on 2022-08-14 at 13:11
japelprime is offline   Reply With Quote
Old 2022-08-15, 00:13   #678
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

11010010100002 Posts
Default

This implies you do not have enough GPU memory. I believe there is a -S option. Try reducing the number of steps per GPU execution
rogue is offline   Reply With Quote
Old 2022-08-16, 20:46   #679
japelprime
 
japelprime's Avatar
 
"Erling B."
Dec 2005

103 Posts
Default

Quote:
Originally Posted by rogue View Post
This implies you do not have enough GPU memory. I believe there is a -S option. Try reducing the number of steps per GPU execution
Thanks. It is working now.
japelprime is offline   Reply With Quote
Old 2022-08-18, 19:11   #680
ryanp
 
ryanp's Avatar
 
Jun 2012
Boulder, CO

1101001102 Posts
Default

Another crash. This is with the latest SVN code.

Code:
$ ./srsieve2 -W 36 -P 1e12 -n 3e6 -N 10e6   -o ferm81_3M_10M.txt -s "81*2^n+1"
srsieve2 v1.6.3, a program to find factors of k*b^n+c numbers for fixed b and variable k and n
(b2) Removed 1750000 algebraic factors for 81*2^n+1 of the form (3^2)*2^(n/2)-3*2^((n+2)/4))+1 when n%4=2
Sieving with generic logic for p >= 3
Sieve started: 3 < p < 1e12 with 5250001 terms (3000000 < n < 10000000, k*2^n+1) (expecting 5041260 factors)
Sieving with single sequence c=1 logic for p >= 257
BASE_MULTIPLE = 30, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720
Split 1 base 2 sequence into 384 base 2^720 sequences.
Legendre summary:  Approximately 2 B needed for Legendre tables
         1 total sequences
         1 are eligible for Legendre tables
         0 are not eligible for Legendre tables
         1 have Legendre tables in memory
         0 cannot have Legendre tables in memory
         0 have Legendre tables loaded from files
         1 required building of the Legendre tables
518400 bytes used for congruent q and ladder indices
295200 bytes used for congruent qs and ladders
Segmentation fault
Seems to segfault no matter what value of -P I try.
ryanp is offline   Reply With Quote
Old 2022-08-18, 20:15   #681
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

24·421 Posts
Default

Quote:
Originally Posted by ryanp View Post
Another crash. This is with the latest SVN code.

Code:
$ ./srsieve2 -W 36 -P 1e12 -n 3e6 -N 10e6   -o ferm81_3M_10M.txt -s "81*2^n+1"
srsieve2 v1.6.3, a program to find factors of k*b^n+c numbers for fixed b and variable k and n
(b2) Removed 1750000 algebraic factors for 81*2^n+1 of the form (3^2)*2^(n/2)-3*2^((n+2)/4))+1 when n%4=2
Sieving with generic logic for p >= 3
Sieve started: 3 < p < 1e12 with 5250001 terms (3000000 < n < 10000000, k*2^n+1) (expecting 5041260 factors)
Sieving with single sequence c=1 logic for p >= 257
BASE_MULTIPLE = 30, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720
Split 1 base 2 sequence into 384 base 2^720 sequences.
Legendre summary:  Approximately 2 B needed for Legendre tables
         1 total sequences
         1 are eligible for Legendre tables
         0 are not eligible for Legendre tables
         1 have Legendre tables in memory
         0 cannot have Legendre tables in memory
         0 have Legendre tables loaded from files
         1 required building of the Legendre tables
518400 bytes used for congruent q and ladder indices
295200 bytes used for congruent qs and ladders
Segmentation fault
Seems to segfault no matter what value of -P I try.
Okay. I will look into it. Does this happen with lower values for -W? I suspect that switch is behind this.
rogue is offline   Reply With Quote
Old 2022-08-18, 20:57   #682
ryanp
 
ryanp's Avatar
 
Jun 2012
Boulder, CO

2·211 Posts
Default

Quote:
Originally Posted by rogue View Post
Okay. I will look into it. Does this happen with lower values for -W? I suspect that switch is behind this.
Yeah, with -W 4 it seems to be working.
ryanp is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 01:04.


Fri Sep 30 01:04:01 UTC 2022 up 42 days, 22:32, 0 users, load averages: 1.00, 1.03, 1.09

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

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔