![]() |
|
|
#1200 | |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
11100001101012 Posts |
Quote:
I'm not sure how CUDALucas handles the errors, but I do know that if you use the -s option, it writes all checkpoint files separately, meaning you can choose one and manually revert to an older save file. In such case it is worth finishing the test, but it may or may not be good. |
|
|
|
|
|
|
#1201 |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3·29·83 Posts |
In the vein of chalsall's submission spider, and in the lookout to test my Python-foo, I decided to write a CUDALucas result submission spider; more than one exponent has had a mismatch, but we couldn't run Prime95 ourselves because the exponent was submitted before checking for a match. That's what this script is designed to do automatically; it checks the exponent status page, and under the right conditions, submits the exponent result, or else prints a warning.
It is used in the same way as chalsall's spider (and draws much of its design from there): Modify the variables at the top as necessary, and run the spider in the directory containing "result.txt", or provide the correct directory as an argument (e.g. for crontabs). Errors automatically terminate the program, and include such things as a bad internet connection or a bad response from PrimeNet. If an error occurs, the current "result.txt" is moved to "failed_(NOW).txt", where result.txt contains everything it did before the script started, i.e. no information is lost (excepting an OS error, but then you've got other problems). Warnings are issued if the script can't parse a line, or can't decide what to do with an exponent; an appropriate message is logged, the offending line is also logged, and the script moves on to the next line. If an exponent result is correctly parsed, it's passed into the "decide" function, which decides what's appropriate; it has the following logic: Code:
if( 2*"Verified LL" is in the expo status page) {
then submit anyways, just in case
} else if( there is a string of 14 lowercase hex digits [or all decimals] {
if(all decimals) { print warning; ask user to check exponent manually }
else { we know there's a CuLu test; exponent will not be submitted
if(your residue matches another) { print "match"; do not submit }
else { print no current matches, use Prime95! do not submit }
}
else { no previous CuLu, and not DCed
if( there is a matching residue ) {submit!}
else { print warning: no match; do not submit }
}
Unfortunately, due to a paucity of exponents, I have not tested every case; I do know that the "Verified LL" portion works as advertised (thanks msft for posting that 2.00 result you had ), and that it works in the basic case of a match with no prior CuLu result, however the other scenarios remain untested (but *should* work).If you would like to try running this, you need Python 3, which can be downloaded here: http://python.org/download/releases/3.2.2/#download In Windows, the installer will associate .py extensions with the interpreter; in *nix, the hashbang should be good enough, assuming you have the interpreter in your PATH. As always, PLEASE report any bugs or unhandled-exceptions, etc. For the first two or three results, I'd recommend checking the exponent status page, and then watching the script run. And, because I'm not sure that the rest works, please also report any successes, especially for cases I haven't been able to test yet. (Yes, yes, this is overkill, but now my Python-foo is that much better )
|
|
|
|
|
|
#1202 | |
|
Dec 2009
Peine, Germany
331 Posts |
Quote:
|
|
|
|
|
|
|
#1203 |
|
Jun 2011
131 Posts |
|
|
|
|
|
|
#1204 | |
|
Dec 2007
22×7 Posts |
Quote:
Also would appreciate a confirmation whether 45ms/iteration is normal for a GT 430: Code:
Iteration 1000000 M( 49845883 )C, 0x656fca42e4bb67e3, n = 2985984, CUDALucas v2.00 err = 0.03711 (1:14:57 real, 44.9724 ms/iter, ETA 609:37:34) |
|
|
|
|
|
|
#1205 | |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3·29·83 Posts |
Quote:
That seems about right; that's a low end card, and you're working on the main LL wave, whose tests are 3-4x as much work as the double checks that others here are doing. For 26M, my GTX 460 gets ~6ms/iter, so it'd get ~15ms/iter would be my guesstimate for a 49M. Divide by three for the 430 vs. 460 and then it seems about right. Have you fiddled with other FFT lengths? (Maybe mess with -threads?) |
|
|
|
|
|
|
#1206 | |
|
Oct 2011
7·97 Posts |
Quote:
|
|
|
|
|
|
|
#1207 |
|
"Jerry"
Nov 2011
Vancouver, WA
21438 Posts |
|
|
|
|
|
|
#1208 |
|
Jun 2011
131 Posts |
|
|
|
|
|
|
#1209 |
|
"Jerry"
Nov 2011
Vancouver, WA
21438 Posts |
|
|
|
|
|
|
#1210 | |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3×29×83 Posts |
Quote:
Code:
LD_LIBRARY_PATH=~/CUDALucas/lib ~/CUDALucas/CUDALucas -c 10000 -f 1474560 -polite 0 worktodo.txt |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Don't DC/LL them with CudaLucas | LaurV | Data | 131 | 2017-05-02 18:41 |
| CUDALucas / cuFFT Performance on CUDA 7 / 7.5 / 8 | Brain | GPU Computing | 13 | 2016-02-19 15:53 |
| CUDALucas: which binary to use? | Karl M Johnson | GPU Computing | 15 | 2015-10-13 04:44 |
| settings for cudaLucas | fairsky | GPU Computing | 11 | 2013-11-03 02:08 |
| Trying to run CUDALucas on Windows 8 CP | Rodrigo | GPU Computing | 12 | 2012-03-07 23:20 |