![]() |
|
|
#23 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
24×389 Posts |
Seems to me that the code should be set to use the 64bit+ algorithm for 62 and 63bit factoring!
|
|
|
|
|
|
#24 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2×33×109 Posts |
|
|
|
|
|
|
#25 |
|
Dec 2003
23·33 Posts |
I greped for "to 2\^63" inn all results.txt files from all of my 102 AMD64 64bit cores doing normal TF, and got no results. None ever for a total of 144218 lines matching "to 2^". If this is a general problem for 32 bit, then why isn't all this work sent to 64bit cores, letting 32bit cores do the other bit levels? Count this as another example of how benchmark guided work selection could speed up GIMPS a lot.
|
|
|
|
|
|
#26 |
|
Aug 2002
Termonfeckin, IE
276410 Posts |
I think the reason for no match is that normal TF usually begins with factoring to 2^63 already done by LMH.
|
|
|
|
|
|
#27 | |
|
Dec 2003
23×33 Posts |
Quote:
Here is a Pentium II 350 MHz: Code:
Best time for 58 bit trial factors: 41.833 ms. Best time for 59 bit trial factors: 41.897 ms. Best time for 60 bit trial factors: 41.744 ms. Best time for 61 bit trial factors: 41.503 ms. Best time for 62 bit trial factors: 77.971 ms. Best time for 63 bit trial factors: 78.024 ms. Best time for 64 bit trial factors: 172.369 ms. Best time for 65 bit trial factors: 174.874 ms. Best time for 66 bit trial factors: 177.939 ms. Best time for 67 bit trial factors: 178.088 ms. Here is a Pentium III 1100 MHz: Code:
Best time for 58 bit trial factors: 13.794 ms. Best time for 59 bit trial factors: 14.130 ms. Best time for 60 bit trial factors: 14.339 ms. Best time for 61 bit trial factors: 13.868 ms. Best time for 62 bit trial factors: 24.615 ms. Best time for 63 bit trial factors: 24.714 ms. Best time for 64 bit trial factors: 55.378 ms. Best time for 65 bit trial factors: 56.591 ms. Best time for 66 bit trial factors: 57.133 ms. Best time for 67 bit trial factors: 57.328 ms. An Intel Xeon 2.7 GHz: Code:
Best time for 58 bit trial factors: 10.700 ms. Best time for 59 bit trial factors: 10.691 ms. Best time for 60 bit trial factors: 10.755 ms. Best time for 61 bit trial factors: 10.722 ms. Best time for 62 bit trial factors: 10.723 ms. Best time for 63 bit trial factors: 11.691 ms. Best time for 64 bit trial factors: 11.729 ms. Best time for 65 bit trial factors: 14.411 ms. Best time for 66 bit trial factors: 14.397 ms. Best time for 67 bit trial factors: 14.386 ms. If theese four were set to factoring, there would be a significant increase of throughput if the PII and PIII got 58 to 62 bit factoring, the Intel Xeon got 63 and 64 bits, and the Atom got 65 bits and above, compared to random work assignment. (Of course one have to make adjustments based on more benchmarks and which work is queueing up on the server.) |
|
|
|
|
|
|
#28 |
|
Aug 2002
Termonfeckin, IE
22×691 Posts |
Thanks for the great work Sturle. I've noticed this too and as a result have taken to running benchmarks on my machines to figure out the most efficient TF bits. If course I have only 7 CPUs unlike your hundreds so it is an easy task for me. But you are right, it would be nice to use TF benchmarks to assign the best bit ranges to a computer.
|
|
|
|
![]() |
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 |