![]() |
llrCUDA Version 3.8.5 is released!
Hi All,
This GPU version of the LLR program has the same features as the previous 3.8.3, but I think that the updates made from it deserve to change the version number. Here are some of these updates : - In previous Version 3.8.4, one call to free() function was missing in Gerbicz error checking code ; this caused an important memory leak... This issue is now fixed here! - K*2^n+c numbers can now be tested using IBDWT, even if abs(c) != 1 - All 64 bits residues match with those obtained with LLR 3.8.24 - several issues found on llrCUDA 3.8.3b3 are now fixed. Please, let me know if you have any problem to run the binary on Linux and/or to build it on your system. I wish you many successes in prime hunting! Best Regards, Jean |
[QUOTE=Jean Penné;602325]Hi All,
This GPU version of the LLR program has the same features as the previous 3.8.3, but I think that the updates made from it deserve to change the version number. Here are some of these updates : - In previous Version 3.8.4, one call to free() function was missing in Gerbicz error checking code ; this caused an important memory leak... This issue is now fixed here! - K*2^n+c numbers can now be tested using IBDWT, even if abs(c) != 1 - All 64 bits residues match with those obtained with LLR 3.8.24 - several issues found on llrCUDA 3.8.3b3 are now fixed. Please, let me know if you have any problem to run the binary on Linux and/or to build it on your system. I wish you many successes in prime hunting! Best Regards, Jean[/QUOTE] Where is the download link? |
[QUOTE=ET_;602360]Where is the download link?[/QUOTE]
Not to step on Jean's toes, but this was provided in his other post: [url]http://jpenne.free.fr/[/url] |
[QUOTE=sdbardwick;602362]Not to step on Jean's toes, but this was provided in his other post: [url]http://jpenne.free.fr/[/url][/QUOTE]
Thanks... my bad, I didn't look below the newest link :redface: |
I was attempting to use this software and got the following error "jesus@Magellan:~/CudaLucas/2/llrcuda385src$ ./llrCUDA -a333333991
*** buffer overflow detected ***: terminated Aborted (core dumped) " |
[QUOTE=Magellan3s;604949]I was attempting to use this software and got the following error "jesus@Magellan:~/CudaLucas/2/llrcuda385src$ ./llrCUDA -a333333991
*** buffer overflow detected ***: terminated Aborted (core dumped) "[/QUOTE] What did you expect? From the [U]readme.txt[/U]: - [C]With -a, you choose another set of .ini and results file. [/C] What you should do is run the program with [C]-m[/C] (or possibly [C]-q[/C] if it is just one candidate) :rtfm: |
[QUOTE=paulunderwood;604950]What did you expect? From the [U]readme.txt[/U]: - [C]With -a, you choose another set of .ini and results file.
[/C] What you should do is run the program with [C]-m[/C] (or possibly [C]-q[/C] if it is just one candidate) :rtfm:[/QUOTE] Sorry, I got it running but I was unable to change the FFT length or test 100 million digit prime numbers. |
[QUOTE=Magellan3s;604989]Sorry, I got it running but I was unable to change the FFT length or test 100 million digit prime numbers.[/QUOTE]
I am glad you got it running. Why do you want to change the FFT length? What is the form of the 100 million digit candidate prime numbers you have in mind? |
[QUOTE=paulunderwood;605002]I am glad you got it running. Why do you want to change the FFT length? What is the form of the 100 million digit candidate prime numbers you have in mind?[/QUOTE]
The current FFT length for a wavefront Mersenne number I attempted to test ~ 113,687,731 selected an FFT of 15M which is much higher than the 6M which should be used for that particular exponent. [code] jesus@Magellan:~/CudaLLR/llrcuda385src$ ./llrCUDA -d -q"1*2^113687731-1" Starting Fermat PRP test of 1*2^113687731-1 Using complex rational base DWT and generic reduction, FFT length = 15728640, a = 3 Iteration: 1 / 113687731 [0.00%]. [/code] I then attempted to test another number M333333991 but the program said the number was too big. [code] jesus@Magellan:~/CudaLLR/llrcuda385src$ ./llrCUDA -d -q"1*2^333333991-1" Requested giant too big. [/code] |
[QUOTE=Magellan3s;605019]The current FFT length for a wavefront Mersenne number I attempted to test ~ 113,687,731 selected an FFT of 15M which is much higher than the 6M which should be used for that particular exponent.
[code] jesus@Magellan:~/CudaLLR/llrcuda385src$ ./llrCUDA -d -q"1*2^113687731-1" Starting Fermat PRP test of 1*2^113687731-1 Using complex rational base DWT and generic reduction, FFT length = 15728640, a = 3 Iteration: 1 / 113687731 [0.00%]. [/code] I then attempted to test another number M333333991 but the program said the number was too big. [code] jesus@Magellan:~/CudaLLR/llrcuda385src$ ./llrCUDA -d -q"1*2^333333991-1" Requested giant too big. [/code][/QUOTE] While it is admirable to attempt testing Mersenne numbers with llrCUDA, most people run gpuOwl for them. Timing comparisons would be interesting. |
[QUOTE=paulunderwood;605022]While it is admirable to attempt testing Mersenne numbers with llrCUDA, most people run gpuOwl for them. Timing comparisons would be interesting.[/QUOTE]
Yes, this program interested me because it was specifically coded with CUDA! |
| All times are UTC. The time now is 13:58. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.