On Wednesday 27 February 2002 06:26, Steve Harris wrote:
For those of you interested in optimizing efficiency of LL testing:
We are approaching first time tests of 15.30M exponents, at which point
the Prime95 program will start using an 896K FFT. However, the P4-SSE2
section of the
On Friday 01 March 2002 00:40, Mary K. Conner wrote:
At 05:17 PM 2/28/02 -0500, George Woltman wrote:
mprime should only raise this error if the pid in the local.ini file and
the current pid are both running mprime (actually comparing the inode
values). If there are any Linux experts that
On Thursday 28 February 2002 22:03, Guillermo Ballester Valor wrote:
Hi,
On Thu 28 Feb 2002 22:19, Brian J Beesley wrote:
[ snip ]
The difference here is that your method generates memory bus traffic at
twice the rate George's method takes advantage of the fact that (with
properly
Hi,
On Friday 01 Mar 2002 21:22, Brian J Beesley wrote:
[ snip ]
The memory bottleneck was the first thing I thought, and I was near to
discard the idea when I realized that the trig bata would be the same,
and the required memory access would be less than double the single
stream
On Fri, Mar 01, 2002 at 08:22:44PM +, Brian J Beesley wrote:
Sure But the only way there would be a problem here (given that the data
values are independent because of the different random offsets) is if there
was a major error like miscounting the number of iterations This is
relatively
On Friday 1 March 2002 15:31, Brian J. Beesley wrote:
On reflection I can see that there is merit in Steve's idea (provided that
restraint is used i.e. not grabbing more work than is neccessary to bridge
the rather small exponent gap).
Thanks, Brian. I probably should have mentioned in my
At 08:58 PM 3/1/02 +, Brian J Beesley wrote:
That would be a crude and surely unusual way of economising
Definitely so, but it's the only way I can think of that someone might use
a hard link when installing mprime For someone coming from Windows, that
might be the way they think to do it
