Re: Decamega Tests (was: RE: Mersenne: GIMPS client output)

1999-09-25 Thread Herb Savage
John R Pierce wrote: There's another trick to this, primarily useful in assembler not C programming... You can do it in C also. Its called Duff's Device. Its ugly but legal C code. Here a URL with info on it: http://bs.cs.tu-berlin.de/~jutta/c/duffs-device.html Regards, Herb

Re: Decamega Tests (was: RE: Mersenne: GIMPS client output)

1999-09-24 Thread Jukka Santala
Philippe Trottier wrote: I don't know how the software of primenet work but When I wanted a really fast execution I was doing like so (The last time I coded it was in 1991) *snap* Sounds like loop unrolling is what you're talking about. Most modern compilers (try to) do this already

Re: Decamega Tests (was: RE: Mersenne: GIMPS client output)

1999-09-24 Thread John R Pierce
Sounds like loop unrolling is what you're talking about. Most modern compilers (try to) do this already automatically. However, I've experimented on different variations of this with the Linux source to, I think, v16 or so, where it seemed possible to attain small benefits from various

Re: Decamega Tests (was: RE: Mersenne: GIMPS client output)

1999-09-23 Thread Philippe Trottier
HI! Anyone tought of send ing these P and Q once a month to the server.. in the case where someone would abandon a quest, it could be continued by someone else ... Notice that in v19 if you set it to get 10 Million range numbers you get a warning about it taking a year on a 500 Mhz P-2, and

Decamega Tests (was: RE: Mersenne: GIMPS client output)

1999-09-22 Thread Brian J. Beesley
On 20 Sep 99, at 1:06, Rick Pali wrote: The only question that comes to mind is if you had to plough through factoring before you got to the LL test...but then I realise that you still wouldn't be done if that were true. You don't have to pre-factor, if you choose "Test" or "Time" from the

Re: Decamega Tests (was: RE: Mersenne: GIMPS client output)

1999-09-22 Thread Kevin Sexton
"Brian J. Beesley" wrote: On 20 Sep 99, at 1:06, Rick Pali wrote: The only question that comes to mind is if you had to plough through factoring before you got to the LL test...but then I realise that you still wouldn't be done if that were true. You don't have to pre-factor, if you

RE: Mersenne: GIMPS client output

1999-09-20 Thread Eric Hahn
Rick, Glad to see *somebody's* awake!! grin From: Eric Hahn P.S. At the 79.3M range, you'll probably not want to set it at 100 iterations... Per iteration time on 266MHz PII with 64MB RAM is 58.781 seconds!!! The only question that comes to mind is if you had to plough through factoring

RE: Mersenne: GIMPS client output

1999-09-19 Thread Rick Pali
From: Darxus Iteration: 164000 / 8410531 [1%]. Clocks: 115665753 = 0.496 sec. Might be nice to display the percentage out to an accuracy that changes every hundred iterations. If you're using version 19, add "PercentPrecision=3" to the prime.ini file. If you want more than three decimal

Re: Mersenne: GIMPS client output

1999-09-19 Thread Lucas Wiman
Might be nice to display the percentage out to an accuracy that changes every hundred iterations. Hmm, looks like that's an integer of the percentage, not rounded. Guess it doesn't matter. For the one I'm working on it looks like 3 decimal places would be needed to see a change every 100

Re: Mersenne: GIMPS client output

1999-09-19 Thread Eric Hahn
Iteration: 164000 / 8410531 [1%]. Clocks: 115665753 = 0.496 sec. Might be nice to display the percentage out to an accuracy that changes every hundred iterations. Hmm, looks like that's an integer of the percentage, not rounded. Guess it doesn't matter. For the one I'm working on it looks

RE: Mersenne: GIMPS client output

1999-09-19 Thread Rick Pali
From: Eric Hahn P.S. At the 79.3M range, you'll probably not want to set it at 100 iterations... Per iteration time on 266MHz PII with 64MB RAM is 58.781 seconds!!! The only question that comes to mind is if you had to plough through factoring before you got to the LL test...but then I