[FRIAM] Large Memory Java Applications

[Marcus G. Daniels]

Hi Dan, that seems like a clever approach..  One remark on this bit:
> In fact, with
> today highly non-uniform memory hierarchies (L1 cache -> L2 cache ->
> ... -> main memory), even using RAM by way of random access can make
> large computations infeasible. 
By Little's law (http://en.wikipedia.org/wiki/Little's_law), concurrency 
= bandwidth * latency.
If it's possible to parallelize the search, then the latency of the 
memory system can be tolerated, as there are more threads of execution 
that can do useful work.  Chances are they won't all be blocked on 
memory access.  For example, with a distributed shared memory package on 
an Infiniband cluster (e.g. Intel's Cluster OpenMP*), or a highly 
multithreaded CPU architecture (UltraSparc T1), I think there's still a 
practical hope not to give up on random access algorithms.

Marcus