mersenneforum.org  

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

Reply
 
Thread Tools
Old 2021-11-28, 23:43   #45
nordi
 
Dec 2016

53 Posts
Default

I also benchmarked four Zen2 cores (=1 core complex) working on 11977759 (FFT length in stage 2 768K) with B2=50,000,000 (which mprime modified a bit) and different RAM settings. The timings are for stage 2 init and stage 2 itself, plus the total time.

Code:
8.5 GB  10.8 + 315.6 = 326.4 seconds   B2=51,228,870
17 GB   24.6 + 165.7 = 190.3 seconds   B2=51,278,370
34 GB   43.4 + 138.3 = 181.7 seconds   B2=72,162,090
Doubling RAM from 8.5 to 17 GB gave 72% more throughput.
Doubling RAM again to 34 GB gave 5% more throughput at a much higher B2.
Even with 96GB available, mprime still used 'only' 34GB, so no more benchmark results. But still, this version wants LOTS of RAM and puts it to excellent use.

Last fiddled with by nordi on 2021-11-28 at 23:45
nordi is offline   Reply With Quote
Old 2021-11-29, 00:36   #46
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

3×5×72×11 Posts
Default

Quote:
Originally Posted by nordi View Post
The automatically chosen B2 was too aggressive!
That will be a problem for a while. Optimal B2 uses a cost function which I have not worked on much. There's little point working on the cost function while the stage 2 code is still being optimized.

I noticed the same thing here on exponents around 80K. B1 of 300 million (2 hours) is getting a B2 of 12 trillion (4 hours).
Prime95 is offline   Reply With Quote
Old 2021-11-29, 04:54   #47
Zhangrc
 
"University student"
May 2021
Beijing, China

269 Posts
Default B2=90M for wavefront P-1(108M)

Code:
[Nov 29 12:46] Setting affinity to run worker on CPU core #2
[Nov 29 12:46] Optimal P-1 factoring of M108390077 using up to 11571MB of memory.
[Nov 29 12:46] Assuming no factors below 2^77 and 2 primality tests saved if a factor is found.
[Nov 29 12:46] Optimal bounds are B1=956000, B2=89586000
[Nov 29 12:46] Chance of finding a factor is an estimated 4.7%
[Nov 29 12:46] 
[Nov 29 12:46] Using FMA3 FFT length 5760K, Pass1=768, Pass2=7680, clm=4, 4 threads
Impressive.

Last fiddled with by Zhangrc on 2021-11-29 at 04:55
Zhangrc is offline   Reply With Quote
Old 2021-11-30, 18:57   #48
Glenn
 
"Glenn Leider"
Apr 2021
Carlsbad, CA

33 Posts
Exclamation Prime95 30.8 (pre-beta) (FOR P-1 USERS ONLY; SMALL EXPONENTS ONLY)

Looks like 30.8 builds are now available. I just downloaded build 2. This should be made a Sticky as soon as possible.

Last fiddled with by petrw1 on 2021-12-01 at 03:15 Reason: Because you asked for it.
Glenn is offline   Reply With Quote
Old 2021-11-30, 19:04   #49
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

2·3·1,801 Posts
Default

30.8 is pre-beta. It should not be stickied yet.
See here for the current issues: https://www.mersenneforum.org/showpo...&postcount=988

Last fiddled with by Uncwilly on 2021-11-30 at 19:07
Uncwilly is online now   Reply With Quote
Old 2021-11-30, 19:24   #50
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

176258 Posts
Default

30.8 is not ready for prime-time!

I made this version available much earlier than normal because it has significant improvements for P-1 stage 2 on "smaller" exponents. This version is only for P-1 users.
Prime95 is offline   Reply With Quote
Old 2021-11-30, 20:26   #51
Glenn
 
"Glenn Leider"
Apr 2021
Carlsbad, CA

33 Posts
Default

Understood. I won’t start using it yet. Hopefully later builds will fix things.

I couldn’t download the stable version of 30.7, only build 9, which I’m currently using.
Glenn is offline   Reply With Quote
Old 2021-11-30, 20:54   #52
techn1ciaN
 
techn1ciaN's Avatar
 
Oct 2021
U. S. / New York, NY

22×37 Posts
Default

Quote:
Originally Posted by Glenn View Post
I couldn’t download the stable version of 30.7, only build 9, which I’m currently using.
That is the stable version. James Heinrich said in the 30.7 thread that the problem with the mersenne.org download should already have been fixed, unless you were experiencing a different one.
techn1ciaN is offline   Reply With Quote
Old 2021-11-30, 22:53   #53
lisanderke
 
"Lisander Viaene"
Oct 2020
Belgium

109 Posts
Default

Perhaps the title of this post could be edited to reflect (on first glance) that it is not ready for all users, at least until that version comes out of pre-beta. (something like: "Prime95 30.8 (ONLY FOR P-1 USERS)")
I think it might be nice to move discussion/bug reports from the sub two k thread to here, in the software category, since there are quite a lot of posts to do with mostly this release/pre-beta version there.


Just a suggestion ofcourse, and thanks for all the continued hard work on this software!!
lisanderke is offline   Reply With Quote
Old 2021-12-01, 07:26   #54
axn
 
axn's Avatar
 
Jun 2003

153316 Posts
Default

Build 2 is bad with multithreading:
Code:
P-1 on M5401951 with B1=8000000, B2=8000000000
Setting affinity to run helper thread 1 on CPU core #2
Setting affinity to run helper thread 3 on CPU core #4
Setting affinity to run helper thread 4 on CPU core #5
Setting affinity to run helper thread 2 on CPU core #3
Using FMA3 FFT length 280K, Pass1=896, Pass2=320, clm=2, 6 threads
Setting affinity to run helper thread 5 on CPU core #6
Conversion of stage 1 result complete. 5 transforms, 1 modular inverse. Time: 1.024 sec.
Setting affinity to run helper thread 1 on CPU core #2
Setting affinity to run helper thread 3 on CPU core #4
Switching to FMA3 FFT length 336K, Pass1=448, Pass2=768, clm=1, 6 threads
Setting affinity to run helper thread 4 on CPU core #5
Setting affinity to run helper thread 2 on CPU core #3
Setting affinity to run helper thread 5 on CPU core #6
Using 56770MB of memory.  D: 43890, 4320x16961 polynomial multiplication.
Round off: 0, poly_size: 2, EB: 1.67728, SM: 3.33496
Round off: 0, poly_size: 4
Round off: 0, poly_size: 8
Round off: 0, poly_size: 16
Round off: 0, poly_size: 32
Round off: 0, poly_size: 64
Round off: 0, poly_size: 128
Round off: 0, poly_size: 256
Round off: 0, poly_size: 512
Round off: 0, poly_size: 1024
Round off: 0, poly_size: 2048
Round off: 0, poly_size: 4096
Round off: 0, poly_size: 8192
Stage 2 init complete. 148272 transforms. Time: 158.998 sec.
Round off: 0
M5401951 stage 2 is 0.00% complete.
M5401951 stage 2 complete. 2128051 transforms. Total time: 2374.162 sec.
Stage 2 GCD complete. Time: 0.652 sec.
M5401951 completed P-1, B1=8000000, B2=8285685870
Compare to build 1:
Code:
P-1 on M5401993 with B1=8000000, B2=8000000000
Using FMA3 FFT length 280K, Pass1=896, Pass2=320, clm=2, 6 threads
Setting affinity to run helper thread 3 on CPU core #4
Setting affinity to run helper thread 2 on CPU core #3
Setting affinity to run helper thread 1 on CPU core #2
Setting affinity to run helper thread 5 on CPU core #6
Setting affinity to run helper thread 4 on CPU core #5
Conversion of stage 1 result complete. 5 transforms, 1 modular inverse. Time: 1.021 sec.
Setting affinity to run helper thread 1 on CPU core #2
Switching to FMA3 FFT length 336K, Pass1=448, Pass2=768, clm=1, 6 threads
Setting affinity to run helper thread 3 on CPU core #4
Setting affinity to run helper thread 2 on CPU core #3
Setting affinity to run helper thread 4 on CPU core #5
Setting affinity to run helper thread 5 on CPU core #6
Using 56770MB of memory.  D: 43890, 4320x16961 polynomial multiplication.
Setting affinity to run polymult helper thread on CPU core #2
Setting affinity to run polymult helper thread on CPU core #3
Setting affinity to run polymult helper thread on CPU core #4
Setting affinity to run polymult helper thread on CPU core #5
Setting affinity to run polymult helper thread on CPU core #6
Stage 2 init complete. 148272 transforms. Time: 112.924 sec.
M5401993 stage 2 is 0.00% complete.
M5401993 stage 2 complete. 2128051 transforms. Total time: 942.714 sec.
Stage 2 GCD complete. Time: 0.663 sec.
M5401993 completed P-1, B1=8000000, B2=8285685870
2374s vs 942s. top shows build 2 is using 200% (with occasional spikes to 500+%) whereas build 1 is consistently pegged at ~600%
axn is offline   Reply With Quote
Old 2021-12-01, 15:46   #55
kruoli
 
kruoli's Avatar
 
"Oliver"
Sep 2017
Porta Westfalica, DE

24·7·11 Posts
Default

Quote:
Originally Posted by kruoli View Post
My test case was two workers. The first had a known factor. The second had some other work:
Code:
[Worker #1]
Pminus1=N/A,1,2,22463209,-1,1000000,324000000,75
[Worker #2]
Pminus1=N/A,1,2,21362113,-1,1000000,32400000,75
Pminus1=N/A,1,2,21362903,-1,1000000,32400000,75
It started normally, but was not stating which B2 it wanted to use. I had a stage 1 file which it used successfully. While stage 2 in worker #1 was running (using 110-115 % of the memory I had allowed it), stage 1 of the first assignment in worker #2 completed and the second assessment was started. After the factor was found, the worktodo entry in worker #1 was removed. It then crashed with error code 0xc0000005 at 0x000000000208b09a.

I tried to start the program again. When entering the worker #2 start (it now tried to start stage 2 of the first assignment of worker #2), it gave a B2 value this time, but crashed again. So I ran it in the debugger and got an error at 0x00007FF7093CB09A in prime95.exe: 0xC0000005: access violation exception reading 0xFFFFFFFFFFFFFFE4.
George, do you need a save file for that? I tested some more (stage 1 done by 30.8b2) and got this again with another exponent, but some exponents are fine. I omitted the system details… This was on a 1950X.
kruoli is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Do not post your results here! kar_bon Prime Wiki 40 2022-04-03 19:05
what should I post ? science_man_88 science_man_88 24 2018-10-19 23:00
Where to post job ad? xilman Linux 2 2010-12-15 16:39
Moderated Post kar_bon Forum Feedback 3 2010-09-28 08:01
Something that I just had to post/buy dave_0273 Lounge 1 2005-02-27 18:36

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


Tue Dec 6 01:39:58 UTC 2022 up 109 days, 23:08, 0 users, load averages: 0.65, 0.88, 0.88

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.

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