From: Ehud Lamm <mslamm@mscc.huji.ac.il>
Subject: Re: Large Look-up Table question ?
Date: 1999/06/03
Date: 1999-06-03T00:00:00+00:00 [thread overview]
Message-ID: <Pine.A41.3.96-heb-2.07.990603142812.97222B-100000@pluto.mscc.huji.ac.il> (raw)
In-Reply-To: 3755a21c@eeyore.callnetuk.com
On Wed, 2 Jun 1999, Nick Roberts wrote:
> A huge array, particularly a linear (one-dimensional) one, can work on a
> virtual memory machine very efficiently when implemented in the language as
> a simple array: the virtual memory management system effectively converts
> the array into a sparse array invisibly.
I suggest trying things out!
Searching a large (~10^6 elements) array of floating point numbers, on a
PC using GNAT seems fast enough (to make life interesting I looked for
the sqrt).
This is part something I am playing with, so there is a good chance more
on this will come later in more detail.
Ehud Lamm mslamm@pluto.mscc.huji.ac.il
next prev parent reply other threads:[~1999-06-03 0:00 UTC|newest]
Thread overview: 9+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-05-31 0:00 Large Look-up Table question ? Nick Wilson
1999-06-01 0:00 ` Steve Quinlan
1999-06-01 0:00 ` czgrr
1999-06-02 0:00 ` Nick Roberts
1999-06-03 0:00 ` Ehud Lamm [this message]
1999-06-03 0:00 ` dennison
1999-06-07 0:00 ` Nick Wilson
1999-06-07 0:00 ` dennison
1999-06-09 0:00 ` Mike Brenner
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox