![]() |
|
|
#12 | |
|
Jul 2006
Calgary
42510 Posts |
Quote:
|
|
|
|
|
|
|
#13 | ||||
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
Quote:
Quote:
Quote:
"Best time for 2560K FFT length: 82.323 ms. ... Best time for 5120K FFT length: 73.077 ms." Is that correct? - - - - - - Quote:
Thus, benchmarking for the purpose of tailoring a choice of assignment may range from possibly-useful (if the non-GIMPS load is relatively stable across both benchmarking and actual assignments -- but how often will that happen in general users' cases?) to useless or even downright counterproductive. Note that using average times rather than best times, in an attempt to account for the non-GIMPS load, may make things worse by burying actual CPU-difference effects that could potentially show up in best-times. Last fiddled with by cheesehead on 2008-12-23 at 21:03 |
||||
|
|
|
|
|
#14 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
10110111111102 Posts |
on my pc i get the same each time
it even does the same underclocked |
|
|
|
|
|
#15 | |
|
Dec 2003
23×33 Posts |
Quote:
This is a rare case. There will not be many cases as extreme as this one, but I am sure you would all agree that for this special machine it would make no sense at all to run a 2560K FFT LL test. If I set preferred work to "GIMPS" (let the server choose), this is exactly the kind of work this machine will get. So I think it makes very good sense for GIMPS to run benchmarks before handing out any kind of work automatically. And then use the benchmarks to select a kind of work each machine's CPU, memory and cache configuration is best suited for, at least to FFT size or trial factor bit depth granularity. Perhaps ask the user how long he or she wishes an average work unit to take at most, to avoid sending 100M tests to beginners. |
|
|
|
|
|
|
#16 | ||
|
Dec 2003
23·33 Posts |
Quote:
Quote:
|
||
|
|
|
|
|
#17 | |
|
Sep 2006
Brussels, Belgium
13×131 Posts |
Quote:
Jacob |
|
|
|
|
|
|
#18 | |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
24×389 Posts |
Quote:
|
|
|
|
|
|
|
#19 | ||
|
Dec 2003
23×33 Posts |
Quote:
Quote:
I just wish mprime could test all his for me. The summary page says I have 538 computers, and it isn't practical to check each and every one of them manually to find which conficuration works best. Here is another thread pointing out differences in efficiency for different FFT sizes and factoring depths for different CPU/cache/memory/bitness configuration. As you can see, there are large diffferences i efficiency even for normal machines. |
||
|
|
|
|
|
#20 | |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
769210 Posts |
Quote:
Can someone construct an example in which, for instance, an AMD's superiority for TF rather than FFT-using tasks is effectively cancelled by the non-GIMPS load's influence, so that L-Ls turn out to be the best choice when one considers average times, but TF appears to be the better choice when only best-times are used? Last fiddled with by cheesehead on 2008-12-25 at 04:56 |
|
|
|
|
|
|
#21 | |
|
Dec 2003
D816 Posts |
Quote:
|
|
|
|
|
|
|
#22 |
|
Dec 2003
23·33 Posts |
I'm not giving up on this.
![]() I still think it is a good idea to run a benchmark and choose work to run or avoid based on the result. Here is another example. This is an Intel Atom N270 CPU at 1.6 GHz. Full benchmark here. Code:
Best time for 58 bit trial factors: 19.060 ms. Best time for 59 bit trial factors: 19.026 ms. Best time for 60 bit trial factors: 18.985 ms. Best time for 61 bit trial factors: 19.153 ms. Best time for 62 bit trial factors: 39.511 ms. Best time for 63 bit trial factors: 39.585 ms. Best time for 64 bit trial factors: 22.897 ms. Best time for 65 bit trial factors: 22.826 ms. Best time for 66 bit trial factors: 22.771 ms. Best time for 67 bit trial factors: 22.848 ms. Btw: Does 63 bit trial factors in the benchmark mean factoring from 63 to 64 bits or 62 to 63 bits? This machine has been assigned work from 63 to 64, not 62 to 63. At least not yet. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Polynomial selection | Max0526 | NFS@Home | 9 | 2017-05-20 08:57 |
| 2^877-1 polynomial selection | fivemack | Factoring | 47 | 2009-06-16 00:24 |
| Polynomial selection | CRGreathouse | Factoring | 2 | 2009-05-25 07:55 |
| Guided Missile. | mfgoode | Puzzles | 46 | 2006-12-17 16:38 |
| Motherboard Selection Help | jugbugs | Hardware | 13 | 2004-06-04 15:59 |