mersenneforum.org  

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

Reply
 
Thread Tools
Old 2023-02-07, 15:14   #991
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009
Not U. + S.A.

262210 Posts
Default

Quote:
Originally Posted by rogue View Post
CPU utilization is used in the calculation. Short runtimes will skew the calculations too.
Very well. I noticed srsieve2cl uses the CPU, to a point. Somewhere between 15% to 20% utilization.
storm5510 is offline   Reply With Quote
Old 2023-02-07, 15:51   #992
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

32·5·157 Posts
Default

Quote:
Originally Posted by storm5510 View Post
Very well. I noticed srsieve2cl uses the CPU, to a point. Somewhere between 15% to 20% utilization.
I should have been more specific. It combines execution time in the GPU with processing time in the CPU. These are not necessarily 1::1. Execution time in the GPU is just a sum of (stopKernelTime - startKernelTime) for each kernel execution. It does not take into account utilization of the GPU. Processing time in the CPU is more precise. The value from the OS takes into account CPU utilization. This makes is easier for the code to compute the percentage of CPU cores that are used with 100% meaning full utilization of a single core.
rogue is online now   Reply With Quote
Old 2023-02-07, 18:48   #993
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009
Not U. + S.A.

2·3·19·23 Posts
Default

Quote:
Originally Posted by rogue View Post
I should have been more specific. It combines execution time in the GPU with processing time in the CPU. These are not necessarily 1::1. Execution time in the GPU is just a sum of (stopKernelTime - startKernelTime) for each kernel execution. It does not take into account utilization of the GPU. Processing time in the CPU is more precise. The value from the OS takes into account CPU utilization. This makes is easier for the code to compute the percentage of CPU cores that are used with 100% meaning full utilization of a single core.
Thank you!

The CPU utilization is being spread across 8 threads at 16%. However, the fine print near the top of the attached image says 100%. Some threads are being used more than others according to the graph. Combining the actual usage of each thread would put it at 100%. Since the removal rate is not real-time, the best thing I can do is use it like a sort of benchmark.

The 60% test I ran with LLR indicated I needed to be consistently above 1,994 seconds per factor with what I am running. This test is real-time so I am not sure I can use this as an indicator of where I need to be with srsieve2cl.
Attached Thumbnails
Click image for larger version

Name:	Capture.JPG
Views:	7
Size:	48.7 KB
ID:	28015  
storm5510 is offline   Reply With Quote
Old 2023-02-07, 21:05   #994
Dylan14
 
Dylan14's Avatar
 
"Dylan"
Mar 2017

3·199 Posts
Default

As a heads up, with new versions of the ld program, the following warning comes up when compiling:

Code:
/usr/bin/ld: warning: x86_asm/avx_powmod.o: missing .note.GNU-stack section implies executable stack
/usr/bin/ld: NOTE: This behaviour is deprecated and will be removed in a future version of the linker
This is due to the fact that making the stack executable can result in a security risk (see this for instance). There doesn't seem to be any ill effect with adding -z noexecstack to the LD_FLAGS in the makefile with regards to the program's performance (at least on small files), so it's probably worth adding this.
Dylan14 is offline   Reply With Quote
Old 2023-02-07, 21:07   #995
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

32×5×157 Posts
Default

Quote:
Originally Posted by Dylan14 View Post
As a heads up, with new versions of the ld program, the following warning comes up when compiling:

Code:
/usr/bin/ld: warning: x86_asm/avx_powmod.o: missing .note.GNU-stack section implies executable stack
/usr/bin/ld: NOTE: This behaviour is deprecated and will be removed in a future version of the linker
This is due to the fact that making the stack executable can result in a security risk (see this for instance). There doesn't seem to be any ill effect with adding -z noexecstack to the LD_FLAGS in the makefile with regards to the program's performance (at least on small files), so it's probably worth adding this.
Okay. I will look into this when I have some time.
rogue is online now   Reply With Quote
Old 2023-02-14, 10:09   #996
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

66616 Posts
Default

Question for srsieve2
As I can remember I can do start sieving multiple sequence at once. Not it doesnot work. I enter few sequences in command line, but got output only for first one. Srsieve2 is from latest mtsieve package ver 1.6.8
pepi37 is offline   Reply With Quote
Old 2023-02-14, 10:15   #997
rebirther
 
rebirther's Avatar
 
Sep 2011
Germany

2×1,733 Posts
Default

Quote:
Originally Posted by pepi37 View Post
Question for srsieve2
As I can remember I can do start sieving multiple sequence at once. Not it doesnot work. I enter few sequences in command line, but got output only for first one. Srsieve2 is from latest mtsieve package ver 1.6.8
I would prefer to put all remaining sequences into a remain.txt and use it as inputfile.
rebirther is offline   Reply With Quote
Old 2023-02-14, 10:41   #998
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

32·5·157 Posts
Default

Quote:
Originally Posted by pepi37 View Post
Question for srsieve2
As I can remember I can do start sieving multiple sequence at once. Not it doesnot work. I enter few sequences in command line, but got output only for first one. Srsieve2 is from latest mtsieve package ver 1.6.8
Each sequence requires -s so if you have 5 sequences there should be 5 -s arguments each with a different sequence.
rogue is online now   Reply With Quote
Old 2023-02-14, 16:54   #999
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009
Not U. + S.A.

2×3×19×23 Posts
Default

Quote:
Originally Posted by rogue View Post
Each sequence requires -s so if you have 5 sequences there should be 5 -s arguments each with a different sequence.
Or put all the sequences in a single text file, each on one line. -s input.txt, for example. It worked for me.

Last fiddled with by storm5510 on 2023-02-14 at 16:56
storm5510 is offline   Reply With Quote
Old 2023-02-14, 23:36   #1000
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

2×32×7×13 Posts
Default

Quote:
Originally Posted by storm5510 View Post
Or put all the sequences in a single text file, each on one line. -s input.txt, for example. It worked for me.
Thanks Storm, first problem is solved

Now second one

Quote:
srsieve2 -P 50000000000000 -W8 -i b10_n.abcd -O factors.txt -l 0
srsieve2 v1.6.8, 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 no memory is allocated for Legendre tables
If I use any other then 0 with -l option I got invalid factor. And if I read correctly -l build Legendre table so sieving with them should be faster?

And last, this is first time I got that on RTX 2070 Super sieving is 75% faster then on Ryzen 5700x ( 8 threads)

Last fiddled with by pepi37 on 2023-02-14 at 23:46
pepi37 is offline   Reply With Quote
Old 2023-02-15, 00:06   #1001
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

32×5×157 Posts
Default

Quote:
Originally Posted by pepi37 View Post
Thanks Storm, first problem is solved

Now second one

If I use any other then 0 with -l option I got invalid factor. And if I read correctly -l build Legendre table so sieving with them should be faster?

And last, this is first time I got that on RTX 2070 Super sieving is 75% faster then on Ryzen 5700x ( 8 threads)
Yes, it should be faster with -l > 0. Please PM me with the details for the invalid factor.
rogue is online now   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 12:46.


Tue Mar 28 12:46:09 UTC 2023 up 222 days, 10:14, 0 users, load averages: 0.91, 0.91, 0.91

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

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