![]() |
|
|
#12 | |
|
Dec 2010
Monticello
5·359 Posts |
Quote:
Better balance might be to run a copy of CudaLucas, which uses very little CPU, instead, or have the #3 core do P-1. Remember that only 10-20% of exponents will be knocked out by the new capabilities of TF, leaving 80-90% still needing those boring old LL tests. But the numbers chuck is throwing out are no slouch...even if they are not at the exact peak of optimum GIMPS TF performance. |
|
|
|
|
|
|
#13 |
|
Dec 2007
Cleves, Germany
2×5×53 Posts |
I'm quite happy with his throughput ...
|
|
|
|
|
|
#14 | |
|
May 2011
Orange Park, FL
92810 Posts |
Quote:
I'm not the smartest one in the room here — I just have money to spend on a fast computer and am retired so have unlimited time. I never could figure out how to work CudaLucas. As I remember it doesn't take its work from a worktodo file and I wouldn't know how to set up a batch file. mfaktc was as complicated a thing as I could manage... The CPU is a core-i7 970 OCd to 3675 MHz, six cores with hyperthreading turned off. Two cores do mfaktc with the GPU, two cores LL, one core DC and one core P-1 |
|
|
|
|
|
|
#15 |
|
Dec 2010
Monticello
5×359 Posts |
I can make you smarter, just keep reading what I tell you:
http://mersenneforum.org/showthread.php?t=15545, towards the end of the thread, gives a quick intro to batch files, and a sample command line for CUDALucas. On Windows, there's not much to them, and you don't need much either -- it got pointed out to me that the simplest batch file (just one line) is a command line associated with one of those "shortcuts" on the desktop. Wordpad is a fine editor for Windows batch files, so is notepad. Then, get you a copy of CUDALucas. There may be some nice pointers in the "putting it all together" thread. If not, you'll need to wade backwards through the CUDALucas thread, but this is admittedly painful. Run said copy, and ask more questions here or somewhere, as we are WAAAYYY off-topic. Oh, and don't run Microsoft Internet Explorer unless you are absolutely required to. That's the first rule of anti-virus. |
|
|
|
|
|
#16 |
|
"Nathan"
Jul 2008
Maryland, USA
5·223 Posts |
Right. I was getting about 107M/sec with SievePrimes=5000, and only 70-80M/sec with SievePrimes=25000.
|
|
|
|
|
|
#17 |
|
"Nathan"
Jul 2008
Maryland, USA
5×223 Posts |
|
|
|
|
|
|
#18 | |
|
"Nathan"
Jul 2008
Maryland, USA
111510 Posts |
Quote:
If we have X GPUs, should we run exactly X copies of mfaktc, or does it make more efficient use of the GPUs to run more? |
|
|
|
|
|
|
#19 | |
|
Dec 2010
Monticello
5·359 Posts |
Quote:
|
|
|
|
|
|
|
#20 | |
|
May 2011
Orange Park, FL
25×29 Posts |
Quote:
Chuck |
|
|
|
|
|
|
#21 |
|
Jun 2005
12910 Posts |
Which tells me that adding a 3rd instance might bring that up to 100% load. Right now 2 CPU cores can't keep up so the GPU is idle for 15% of the time. You'd just have to balance whether 100% of one CPU core is worth trading for an extra 15% of a GPU core. And as you mentioned, that includes not only performance trade-offs, but heat, noise and so on.
You might also consider doing a higher bit-depth for the 600M range. It's possible that there's so much overhead in running such a small bitlevel on a fast card that adding 1 more bit might not slow down the process that much. I have no idea to the answers to any of these questions, but it might be worth a try experimenting. |
|
|
|
|
|
#22 | |
|
May 2011
Orange Park, FL
25×29 Posts |
Quote:
|
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| SievePrimes is too big for the current assignment | mattmill30 | GPU to 72 | 21 | 2017-02-01 00:20 |
| 4000 < k < 5000 | otutusaus | Riesel Prime Data Collecting (k*2^n-1) | 5 | 2012-03-07 20:01 |
| 5000 < k < 6000 | justinsane | Riesel Prime Data Collecting (k*2^n-1) | 26 | 2010-12-31 12:27 |
| Factoring on a 5000+ | jasong | Hardware | 3 | 2006-06-17 08:50 |
| Top-5000 List | edorajh | Riesel Prime Search | 17 | 2006-03-28 21:57 |