mersenneforum.org  

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

Reply
 
Thread Tools
Old 2019-11-03, 14:54   #12
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

132138 Posts
Default

Quote:
Originally Posted by storm5510 View Post
Using the version of mfaktc I had, the 1080 would run around 1050 GHz-d/day. This one was 730 GHz-d/day., more or less. This was with base 2.
So, the ~30% performance loss in gr-mfaktc relative to mfaktc means Mersenne factorers should stick with the mainstream mfaktc.
kriesel is online now   Reply With Quote
Old 2019-11-03, 15:02   #13
MrRepunit
 
MrRepunit's Avatar
 
Mar 2011
Germany

10111012 Posts
Default

Quote:
Originally Posted by kriesel View Post
So, the ~30% performance loss in gr-mfaktc relative to mfaktc means Mersenne factorers should stick with the mainstream mfaktc.
For now yes. At a later point I might create a version that uses the original code path for Mersenne primes, probably once I have included negative bases...
MrRepunit is online now   Reply With Quote
Old 2019-11-05, 13:32   #14
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009

22×32×5×11 Posts
Default

Something I was thinking about late yesterday evening: Below is a line from your work example file in the archive.

Code:
Factor=base=10,1055167,1,64
Question: Are the start and end bits of the same power, as in 101 to 1064?
storm5510 is offline   Reply With Quote
Old 2019-11-05, 21:22   #15
MrRepunit
 
MrRepunit's Avatar
 
Mar 2011
Germany

3·31 Posts
Default

Quote:
Question: Are the start and end bits of the same power, as in 101 to 1064?

The search boundaries are always a power of 2.

Last fiddled with by MrRepunit on 2019-11-05 at 21:22
MrRepunit is online now   Reply With Quote
Old 2019-11-13, 18:49   #16
lalera
 
lalera's Avatar
 
Jul 2003

26316 Posts
Default

hi,
i tried out gr-mfaktc-0.21 with base=6, n=600k to 1000k on a gtx1050ti and the performance is good
lalera is offline   Reply With Quote
Old 2019-11-13, 20:44   #17
MrRepunit
 
MrRepunit's Avatar
 
Mar 2011
Germany

3×31 Posts
Default

Quote:
Originally Posted by lalera View Post
hi,
i tried out gr-mfaktc-0.21 with base=6, n=600k to 1000k on a gtx1050ti and the performance is good
Up to 2^64 the performance should be really good because there is a special 64 bit GPU kernel. To get optimal performance you should disable the stages in mfaktc.ini:
Code:
Stages=0
If the desktop should get too unresponsive, then also lower the GPUSieveSize:
Code:
GPUSieveSize=8

Last fiddled with by MrRepunit on 2019-11-13 at 20:44
MrRepunit is online now   Reply With Quote
Old 2019-11-13, 20:57   #18
lalera
 
lalera's Avatar
 
Jul 2003

61110 Posts
Default

hi,
i think that i need
stages=1
because i do use
StopAfterFactor=2
in mfaktc.ini
lalera is offline   Reply With Quote
Old 2019-11-16, 15:31   #19
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009

22·32·5·11 Posts
Default

Quote:
Originally Posted by lalera View Post
hi,
i think that i need
stages=1
because i do use
StopAfterFactor=2
in mfaktc.ini
I have used "Stages" set to zero with "StopAfterFactor" set to 2 on some tests, like the example below.

Code:
Factor=N/A,96751147,73,75
There is no separation, so if it finds a factor, it is done regardless of where it is in the process.
storm5510 is offline   Reply With Quote
Old 2019-12-13, 14:48   #20
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009

36748 Posts
Default

Quote:
Originally Posted by MrRepunit View Post
...finally I completed the generalized repunit version of mfaktc.

Changes compared to mfaktc-0.21:
- implemented factoring of generalized repunits
- Removed Barrett and 72 bit kernels
- Removed Wagstaff related stuff
- Added 64 bit kernels
- Compiling with more-classes flag seem to be slightly faster, thus it is switched on
- allowed are all bases >= 2, program might crash if base is larger than roughly 100,000
- implemented special cases for bases 2, 3, 5, 6, 7, 8, 10, 11, 12

- dropped lower limit for exponents from 100,000 to 50,000

Question: Would you be willing to do a custom build for a single individual?
storm5510 is offline   Reply With Quote
Old 2019-12-15, 00:15   #21
MrRepunit
 
MrRepunit's Avatar
 
Mar 2011
Germany

1358 Posts
Default

Quote:
Originally Posted by storm5510 View Post
Question: Would you be willing to do a custom build for a single individual?
Hi. Yes, I can do it if the wished-for changes are doable in some shorter time. My guess is that you want to lower the minimal exponent limit. Can do it, but than I cannot promise it still works in all cases. Also the program will waste more time because the presieving depth is affected.
But anyway, let me know what you need...
MrRepunit is online now   Reply With Quote
Old 2019-12-15, 01:18   #22
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009

22·32·5·11 Posts
Default

Quote:
Originally Posted by MrRepunit View Post
Hi. Yes, I can do it if the wished-for changes are doable in some shorter time. My guess is that you want to lower the minimal exponent limit. Can do it, but than I cannot promise it still works in all cases. Also the program will waste more time because the presieving depth is affected.
But anyway, let me know what you need...
Thank you for the reply. This was just a passing thought. As time has gone by, the bottom end seems to have crept up on everything. Many are 100,000, leaving the smaller exponents with ECM and not much more. Then, on only a few programs. The downside is the time required to run the small ones to higher bit sizes.

An example: I have a very old factoring program called Factor5. It uses the CPU only. A while back, I gave it a small exponent, M1619 I believe it was. Start and end bits in the mid 60's. It stayed at 0.000% for 20 minutes or so before it changed. I did the math to 100%. Hundreds of years, or maybe thousands. So, it would not be anywhere near practical to do anything like this, even with a GPU.
storm5510 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
mfaktc: a CUDA program for Mersenne prefactoring TheJudger GPU Computing 3506 2021-09-18 00:04
mfakto: an OpenCL program for Mersenne prefactoring Bdot GPU Computing 1680 2021-09-13 17:01
The P-1 factoring CUDA program firejuggler GPU Computing 753 2020-12-12 18:07
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 12:49.


Sat Oct 16 12:49:42 UTC 2021 up 85 days, 7:18, 0 users, load averages: 1.13, 1.49, 1.56

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