![]() |
|
|
#320 |
|
Oct 2002
France
33·5 Posts |
|
|
|
|
|
|
#321 |
|
"Oliver"
Mar 2005
Germany
11×101 Posts |
Hello everybody,
find attached mfaktc 0.10. ![]() Highlights of this version: - two new runtime options: Stages and StopAfterFactor (see mfaktc.ini for details) - modified the stream scheduling (suggested by Ethan). Older versions assumed the the streams are processed in the way there were issued. The new way improves the performance a little bit in some cases (e.g. multiple instances of mfaktc) and narrows the gap between Windows and Linux (but doesn't solve the Windows / CUDA 3.1 / 25x.xx driver bug?! )- threads per grid is determined during runtime based on the number of multiprocessors of the GPU. This was necessary since Nvidia releases more and more GPUs with a non-power-of-two number of multiprocessors... Oliver |
|
|
|
|
|
#322 |
|
Mar 2010
3×137 Posts |
Looking forward for a x64 binary for sm_11 arch
Last fiddled with by Karl M Johnson on 2010-07-27 at 08:18 |
|
|
|
|
|
#323 | |
|
Banned
"Luigi"
Aug 2002
Team Italia
10010110100112 Posts |
Quote:
Luigi |
|
|
|
|
|
|
#324 | |
|
"Oliver"
Mar 2005
Germany
11×101 Posts |
Hello Luigi,
Quote:
About the little performance boost... you're talking about your GTX 275 and running Linux? I would that this is not a configuration where you'll see the little improvement. Spoiler alert: But don't be too sad, you'll see an improvement with the next version! 0.11 has a faster sieve. I've tested SievePrimes 20.000, 30.000 and 40.000, in all cases the new sieve does ~25% more throughput (good for users with GTX 4xx). On the other hand this could be used to increase SievePrimes which will remove more candidates during sieving. On my system the sieve of 0.10 with SievePrimes=20.000 is capable to generate ~89M/s candidates and the new 0.11 does the same speed with SievePrimes=40.000 (which yields 3-4% more candidates removed ==> 3-4% overall speed increase). ![]() Now the bad news: - 0.11 need more testing - you have to wait a little bit ![]() Oliver |
|
|
|
|
|
|
#325 |
|
Oct 2002
France
13510 Posts |
Hi,
the new version is working on my config: Config: Ubuntu 10.04 nvidia driver 256.35 CUDA 3.1 GPU: NVIDIA QUATTRO 140M So for now I'm trying it on 3321931967,76,77 (I need to reserve it). I have a question. When I run mfaktc 0.10, my computer is unusable. It seems mfacktc is using all GPU power and so, I can't use my computer (to login or to open a window). I also notice that it use one of the core to 100%. Is it normal? Thanks Last fiddled with by Aillas on 2010-07-28 at 11:31 |
|
|
|
|
|
#326 | |
|
Banned
"Luigi"
Aug 2002
Team Italia
113238 Posts |
Quote:
I experimented the same behavior when using mfaktc with Ubuntu_64 9.10 and nVidia GTX 275: the graphical interface is nearly unusable. It doesn't affect my life, thanks to the resume file: when I need to access my desktop, I turn mfaktc off... ![]() As for the CPU usage, the program uses two sections: one runs on the GPU, the other (the siever IIRC) tries to keep up with the GPU, preparing presieved intervals of testing factors. So in short, yes, it is quite normal that one core is kept busy during elaboration. Now check out your exponent here, and remember to post your results here. Good luck! Luigi Last fiddled with by ET_ on 2010-07-28 at 12:57 |
|
|
|
|
|
|
#327 | |
|
Oct 2002
France
33·5 Posts |
Quote:
PS: It's the 32 bit version of Ubuntu. Is it a problem ? |
|
|
|
|
|
|
#328 | |
|
"Oliver"
Mar 2005
Germany
11·101 Posts |
Hello Aillas,
Quote:
About the unusability... this is normal, too. You can try to - lower the THREADS_PER_GRID_MAX to e.g. 1<<16 (params.h, requiers recompile) - run only one stream (NumStreams=1 in mfaktc.ini) This seems to depend on the GPU, too. "slow GPUs" have a higher runtime on a single kernel launch and the GPU can only process one thing at once... so there are no GUI updates while the kernel runs. Faster GPU = lower runtime per kernel => more GUI updates per second. It seems that those Geforce 4xx series are much better than their predecessors in this situation. ![]() I know, this doesn't help you, sorry. ![]() Oliver Last fiddled with by TheJudger on 2010-07-28 at 13:01 |
|
|
|
|
|
|
#329 |
|
"Oliver"
Mar 2005
Germany
11·101 Posts |
It should work on 32bit, too. I tried some 32bit builds on my 64bit Linux and they seem to work as expected. Just the sieve is ~33% slower on 32bit but this won't hurt you. I think you're hitting SievePrimes=100000 easily, right?
Oliver Last fiddled with by TheJudger on 2010-07-28 at 13:04 |
|
|
|
|
|
#330 |
|
Oct 2002
France
33·5 Posts |
This is the standard behavior. So it's ok for me. I didn't want to run the program many days for nothing.
Now, I'm curious how many days it will take to sieve 3321931967 from 76 to 77 bit on a Quatro 140 M. Maybe next time I should try exponants in the new lower range... Thanks for your support. Ludovic |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| mfakto: an OpenCL program for Mersenne prefactoring | Bdot | GPU Computing | 1676 | 2021-06-30 21:23 |
| The P-1 factoring CUDA program | firejuggler | GPU Computing | 753 | 2020-12-12 18:07 |
| gr-mfaktc: a CUDA program for generalized repunits prefactoring | MrRepunit | GPU Computing | 32 | 2020-11-11 19:56 |
| mfaktc 0.21 - CUDA runtime wrong | keisentraut | Software | 2 | 2020-08-18 07:03 |
| World's second-dumbest CUDA program | fivemack | Programming | 112 | 2015-02-12 22:51 |