mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Hardware > GPU Computing

Reply
 
Thread Tools
Old 2020-10-18, 12:15   #3356
tServo
 
tServo's Avatar
 
"Marv"
May 2009
near the Tannhäuser Gate

2·3·7·13 Posts
Default

Quote:
Originally Posted by storm5510 View Post
In this case, is it using Linux drivers or Windows drivers? I believe it to be the latter. I don't see a reason why it would not. I have no need to run a GPU program with it.
Perhaps this documentation might answer some questions.
It is from the latest Cuda toolkit ( 11.x ) and shows how to run the Cuda toolkit from WSL2.

https://docs.nvidia.com/cuda/wsl-user-guide/index.html
tServo is offline   Reply With Quote
Old 2020-10-18, 13:55   #3357
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

47×101 Posts
Default odds

Quote:
Originally Posted by aheeffer View Post
What are the odds? Mfaktc found two factors in the same 79-bit range:

387687056493187475315017 and 413121450787122123422543 divide M333114347
Slim, but cumulative. In a single attempt,

in the same bit level,
(bitlevel-1)/bitlevel * (ln(bitlevel/(bitlevel-1)))2 / 2 =
78/79 * (ln(79/78))2 / 2 = 8.03E-5.

In the same class c of the same bit level,
(bitlevel-1)/bitlevel * (ln(bitlevel/(bitlevel-1)))2 / 2 / c =
78/79 * (ln(79/78))2/2/c. Assuming more-classes, c=960; 8.35E-8

Make enough TF runs (tens of thousands or more), and finding two factors in the same bit level occurring at least once becomes almost inevitable.

https://www.mersenneforum.org/showpo...82&postcount=5

I hit these recently:
Code:
Manual testing    104615629    F    2020-10-16 14:48    0.0    Factor: 75292655729231867474113 / TF: 75-76    72.7737
Manual testing    104615629    F    2020-10-16 14:48    0.0    Factor: 52035700039723086976271 / TF: 75-76    33.7870
That's once, in the past 6 months reviewed.
kriesel is online now   Reply With Quote
Old 2020-10-18, 14:01   #3358
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

31×103 Posts
Default

It's harder to see from the data since many people (most?) will stop factoring immediately after finding a factor, so unless the factor pair is in the same class the second factor wouldn't be discovered.
James Heinrich is offline   Reply With Quote
Old 2020-10-18, 15:00   #3359
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

47×101 Posts
Default

Quote:
Originally Posted by James Heinrich View Post
It's harder to see from the data since many people (most?) will stop factoring immediately after finding a factor, so unless the factor pair is in the same class the second factor wouldn't be discovered.
Right. Depends on settings in this part of the mfaktc.ini (my default settings shown)
Code:
# Allow to split an assignment into multiple bit ranges.
# 0 = disabled
# 1 = enabled
# Enabled Stages make only sense when StopAfterFactor is 1 or 2.
# Do not change this in the middle of a run which spans over multiple
# bitlevels, in this case mfaktc will ignore the checkpoint file and
# restarts from the beginning.
#
# Default: Stages=1

Stages=1


# possible values for StopAfterFactor:
# 0: Do not stop the current assignment after a factor was found.
# 1: When a factor was found for the current assignment stop after the
#    current bitlevel. This makes only sense when Stages is enabled.
# 2: When a factor was found for the current assignment stop after the
#    current class.
#
# Default: StopAfterFactor=1

StopAfterFactor=1
Computing credit is given as if the setting was StopAfterFactor=2. (Which is less than the computing performed when StopAfterFactor=1, in the case of factor(s) found.)
kriesel is online now   Reply With Quote
Old 2020-10-18, 15:04   #3360
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

31×103 Posts
Default

Quote:
Originally Posted by kriesel View Post
Computing credit is given as if the setting was StopAfterFactor=2. (Which is less than the computing performed when StopAfterFactor=1, in the case of factor(s) found.)
I believe credit should be given appropriately depending whether the bit level was finished or not. If this is not the case please email/PM me a note/reminder with a screenshot of manual form output and I'll look into it.
James Heinrich is offline   Reply With Quote
Old 2020-10-18, 16:26   #3361
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

47·101 Posts
Default

Quote:
Originally Posted by James Heinrich View Post
I believe credit should be given appropriately depending whether the bit level was finished or not. If this is not the case please email/PM me a note/reminder with a screenshot of manual form output and I'll look into it.
I've seen it happen repeatedly that TF factor found credit given is less than the full corresponding bit level. (Unless I've been reading it wrong somehow.)
Will email you next time I (a) hit a factor, and (b) remember to do the screen capture(s) and email. Forum PM does not support attachments IIRC.

Last fiddled with by kriesel on 2020-10-18 at 16:27
kriesel is online now   Reply With Quote
Old 2020-10-18, 16:37   #3362
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

C7916 Posts
Default

If you complete the bit level after finding factor it should give full credit, if you stop after factor found then scaled credit is appropriate. I'm out of town for 2 days but can double check the code when you email me.
James Heinrich is offline   Reply With Quote
Old 2020-10-18, 16:41   #3363
Viliam Furik
 
Jul 2018
Martin, Slovakia

26010 Posts
Default

Quote:
Originally Posted by James Heinrich View Post
I believe credit should be given appropriately depending whether the bit level was finished or not. If this is not the case please email/PM me a note/reminder with a screenshot of manual form output and I'll look into it.
I can confirm, mersenne.org gives credit only for work done before the factor is found if it's found. But neither I have a fresh factor, so I can't provide evidence immediately.
Viliam Furik is offline   Reply With Quote
Old 2020-10-19, 10:27   #3364
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

100010111110112 Posts
Default

Yep, it works as expected. See discussion around, where somebody complained the given credit for factor was only 70% or so. I have many factors which got lower credit than completing full bitlevel. Which is normal, as the work done to find the factor was less than the full bitlevel, sometimes very low if the factor was found in first classes.
LaurV is offline   Reply With Quote
Old 2020-10-19, 11:24   #3365
kruoli
 
kruoli's Avatar
 
"Oliver"
Sep 2017
Porta Westfalica, DE

2×5×37 Posts
Default

Quote:
Originally Posted by LaurV View Post
Yep, it works as expected.
Only if you stop after finding a factor! Yes, that's the default option, but continuing should also be credited, is what James says.
kruoli is offline   Reply With Quote
Old 2020-10-19, 11:44   #3366
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

32·5·199 Posts
Default

Oh, you mean the other way around... Never tried that, because I always stop after class, but it should be easy to try, just take a factor line already reported and edit the asterisk. I will try when I reach home in about one hour (still at job).
LaurV is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
mfakto: an OpenCL program for Mersenne prefactoring Bdot GPU Computing 1657 2020-10-27 01:23
The P-1 factoring CUDA program firejuggler GPU Computing 752 2020-09-08 16:15
"CUDA runtime version 0.0" when running mfaktc.exe froderik GPU Computing 4 2016-10-30 15:29
World's second-dumbest CUDA program fivemack Programming 112 2015-02-12 22:51
World's dumbest CUDA program? xilman Programming 1 2009-11-16 10:26

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

Wed Dec 2 04:06:51 UTC 2020 up 83 days, 1:17, 1 user, load averages: 2.21, 2.30, 2.10

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