Mersenne: RE: L2 Cache

2001-09-09 Thread Stephan T. Lavavej
George Woltman wrote: > b) More importantly, the CPU caches work less effectively as the > FFT gets larger. A 64K FFT can fit within some CPU's L2 caches. > Jumping to a 128K FFT means half the data is in the L2 cache and > half is in main memory (when switching from pass 1 to pass 2 of > the FF

Re: AW: Mersenne: Prime Net Server

2001-09-09 Thread bjb
On 10 Sep 2001, at 7:34, [EMAIL PROTECTED] wrote: > I beg your pardon: you didn´t really expect to get informed about a > planned outage BEFORE it happens or a crash AFTER it happened, did > you? Well, as a service operator myself (though without any responsibility to PrimeNet), I do try to war

Re: Mersenne: Prime Net Server

2001-09-09 Thread John R Pierce
> Such an outage didn´t occur for the first time in my (nearly) > three years supporting GIMPS and others will follow. May be that´s > one reason why GIMPS lost about 8.000 to 9.000 machines during the last six months. I dunno, I've let about 1/2 my machines drop out, they were mostly p133 and be

AW: Mersenne: Prime Net Server

2001-09-09 Thread Achim . Passauer
I beg your pardon: you didn´t really expect to get informed about a planned outage BEFORE it happens or a crash AFTER it happened, did you?   If you did expect this, then you should have joined another distributed-computing project like SETI. They do inform their participants about such thin

Re: Mersenne: Any News On Server Availability?

2001-09-09 Thread George Woltman
Hi, At 02:14 PM 9/9/2001 -0700, xqrpa wrote: >Server seems to be down now over 24 hours... > >Or am I cruising a wormhole? By my reckoning it's been down close to two days. Hopefully things will return to normal when the full crew returns to work on Monday. I have no news as to the cause of th

Mersenne: Any News On Server Availability?

2001-09-09 Thread xqrpa
Server seems to be down now over 24 hours...   Or am I cruising a wormhole?   Best Wishes, Stefanovic

Re: Mersenne: Time Algorithm

2001-09-09 Thread Jason Stratos Papadopoulos
On Sun, 9 Sep 2001, George Woltman wrote: > c) At these large FFT sizes, we are now putting pressure on the > TLB caches. The TLB maps a virtual address into a physical address. > Intel chips keep track of 64 TLB entries, each entry maps to a 4KB > page. >

Re: Mersenne: Time Algorithm

2001-09-09 Thread George Woltman
Hi Terry, At 01:58 AM 9/9/2001 -0700, Terry S. Arnold wrote: >What is the correct algorithm for calculating the time credit for a LL >test of an exponent? Take the timing on the status page, multiply it by the exponent. That gets your the PII-400 timing in seconds. Divide by (86400 * 365). T

Mersenne: Time Algorithm

2001-09-09 Thread Terry S. Arnold
What is the correct algorithm for calculating the time credit for a LL test of an exponent? I did a linear interpolation from the times in the status page and this does not match reality. When I think about the growth characteristics of a FFT it appears that my approximation was naive. Regard