![]() |
|
|
#1255 | |
|
"James Heinrich"
May 2004
ex-Northern Ontario
11·311 Posts |
Quote:
http://mersenne-aries.sili.net/expon...tails=42717929 |
|
|
|
|
|
|
#1256 | |
|
Dec 2007
Cleves, Germany
2×5×53 Posts |
Quote:
Code:
if (preg_match('#^Factor=(|N/A,|[A-F0-9]{32},)([0-9]{4,10}),([0-9]{1,2}),([0-9]{2})$#i', $line, $matches)) {
@list($all, $aid, $exponent, $tf1, $tf2) = $matches;
$key = count($GoodAssignmentsLine);
$GoodAssignmentsLine[$key] = $line;
$GoodAssignmentsWork[$key] = (($_REQUEST['easyis'] == 'small') ? $exponent : CalcGHzDaysTrialFactor($exponent, $tf1, $tf2));
}
|
|
|
|
|
|
|
#1257 |
|
"James Heinrich"
May 2004
ex-Northern Ontario
11·311 Posts |
That's what I get for adding features later on and not checking for side effects
I've fixed it now.(The original incarnation of the balancer did not have a variable definition of "easy", it was just the GHz-days effort, so adding it up made perfect sense.) |
|
|
|
|
|
#1258 | |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
230478 Posts |
Quote:
I would also be willing to donate my time to assist James (but without access). While I don't do PHP (except when I have to; and only then under protest -- I'm a Perl guy) I do do Regular Expressions (RegEx) and SQL for a living. |
|
|
|
|
|
|
#1259 |
|
P90 years forever!
Aug 2002
Yeehaw, FL
1D7116 Posts |
|
|
|
|
|
|
#1260 | |
|
Jun 2011
131 Posts |
Quote:
BTW I started doing this after my regular submission were assigned to P-1. From my results page they seem to be at the lowest bit level of an assignment. What if while reporting "has a factor" result at the lowest bit level of an assignment I swap the lines in manual submission like this: Code:
found 1 factor(s) for M57841799 from 2^71 to 2^72 [mfaktc 0.17-Win apsen barrett79_mul32] M57841799 has a factor: 2692557022299923757047 If not what would happen if I add false "no factor" line for previously completed bit levels in front. Like: Code:
no factor for M57841799 from 2^70 to 2^71 [mfaktc 0.17-Win apsen 71bit_mul24] M57841799 has a factor: 2692557022299923757047 found 1 factor(s) for M57841799 from 2^71 to 2^72 [mfaktc 0.17-Win apsen barrett79_mul32] Last fiddled with by apsen on 2011-10-02 at 05:37 |
|
|
|
|
|
|
#1261 |
|
Dec 2010
Monticello
5×359 Posts |
This is why I like the idea that each line is a complete, true, and accurate statement, thus:
Code:
M57841799 has a factor: 265255702299923757047 [mfaktc 0.18-Win Christenson] found exactly 1 factor(s) for M57841799 from 2^71 to 2^72 [mfaktc 0.18-Win Christenson] found at least 1 factor for M57841799 from 2^71 to 2^72 [mfaktc 0.18-Win Christenson] |
|
|
|
|
|
#1262 |
|
"James Heinrich"
May 2004
ex-Northern Ontario
11×311 Posts |
It looks like I'll be able to help George revise the parsing logic in the near future. Don't expect anything changed today or tomorrow, but if we can collectively decide on a standardized format for the results (by the end of this week, let's say), I'll see if I can get the results parser to understand it all correctly within a few weeks.
|
|
|
|
|
|
#1263 |
|
Dec 2010
Monticello
179510 Posts |
Hey Oliver:
Just noticed an overflow in the class-by-class status reporting....suddenly got a huge number of seconds reported for the time field that had nothing to do with what was happening on my wristwatch. This is on Linux 64, mfaktc-0.17, under xubuntu 10.10. The box has been up for about 4 days, and runing mfaktc for most of that time. Eric This hapened |
|
|
|
|
|
#1264 |
|
"Oliver"
Mar 2005
Germany
11·101 Posts |
Hi Eric,
I know this bug. It doesn't matter how long mfaktc is running (actually I've noticed this rarely while developing with some *very short* runs) I'll take a look at this. Oliver |
|
|
|
|
|
#1265 | ||
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2·4,909 Posts |
Quote:
Quote:
|
||
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| mfakto: an OpenCL program for Mersenne prefactoring | Bdot | GPU Computing | 1676 | 2021-06-30 21:23 |
| The P-1 factoring CUDA program | firejuggler | GPU Computing | 753 | 2020-12-12 18:07 |
| gr-mfaktc: a CUDA program for generalized repunits prefactoring | MrRepunit | GPU Computing | 32 | 2020-11-11 19:56 |
| mfaktc 0.21 - CUDA runtime wrong | keisentraut | Software | 2 | 2020-08-18 07:03 |
| World's second-dumbest CUDA program | fivemack | Programming | 112 | 2015-02-12 22:51 |