On Mon, Mar 18, 2002 at 02:12:48PM +, Brian J. Beesley wrote:
On Monday 18 March 2002 10:21, Nick Craig-Wood wrote:
There has been some discussion on the linux kernel mailing list about
providing 2 MB pages (instead of 4kB ones) to user space for the use
of database or scientific
At 10:17 AM 3/18/02 +, you wrote:
On Sun, Mar 17, 2002 at 08:08:06PM -0500, Jason Papadopoulos wrote:
If you want to explore your idea further, here are some primes that may
be useful. All are of the form i*2^e+1, and have the advantage that roots
of unity out to some small order are
On Tuesday 19 March 2002 10:09, Nick Craig-Wood wrote:
On Mon, Mar 18, 2002 at 02:12:48PM +, Brian J. Beesley wrote:
If the active data is already memory resident, TLB thrashing is not going
to be an issue.
The TLB (translation lookaside buffer) has very little to do with the
On Tue, Mar 19, 2002 at 08:11:54PM +, Brian J. Beesley wrote:
The speed it's running at suggests
that any performance loss due to TLB thrashing is small, since the extra drop
beyond linearity is only about what one would expect from the LL test
algorithm being O(n log n).
Disclaimer: My
On Tue, Mar 19, 2002 at 08:11:54PM +, Brian J. Beesley wrote:
Ah, but ... frequently accessing pages (virtual _or_ physical) will
keep the TLB pages from getting too far away from the processor;
probably at worst they will stay in the L1 cache.
Yes.
The overhead of accessing from L1
On Tue, Mar 19, 2002 at 10:03:50PM +0100, Steinar H. Gunderson wrote:
Paste from gwnum.c, Prime95 v19:
/* Well I implemented the above only to discover I had dreadful */
/* performance in pass 1. How can that be? The problem is that each */
/* cache line in pass 1 comes from a
to find the value v where prime p is a factor of 2^v-1
tempvalue = p
count = 0
while tempvalue != 0
{
if tempvalue is odd
{
shiftright tempvalue
count++
}
else
{
tempvalue+=p
}
}
if the count is a primenumber then p is thus a factor of a mersenne prime
if the
At 10:29 PM 3/19/02 +, you wrote:
On Tue, Mar 19, 2002 at 10:03:50PM +0100, Steinar H. Gunderson wrote:
Paste from gwnum.c, Prime95 v19:
/* Well I implemented the above only to discover I had dreadful */
/* performance in pass 1. How can that be? The problem is that each */
/*
