Re: Out-of-Memory Handling in Long-Running / Server Applications

On Monday 14 April 2008 13:38, Attila Szegedi wrote:
> On 2008.04.14., at 22:08, Randall R Schulz wrote:
> > ...
> >
> > The access patterns are such that to achieve anything near
> > acceptable performance, the tree and the priority queue must remain
> > in the working
> > set.
>
> You could look into Terracotta. While it's primarily a JVM clustering
> solution, almost as a side-effect it gives you a >4GB disk backed
> virtual heap where your RAM based heap basically serves as a cache.

Interesting. I've become aware of Terracotta recently, but this aspect
never occurred to me.

While I can't see that it would be suitable for the prover's main loop
where the heuristically driven search of an incrementally built tree
occurs, it might be helpful for another design problem I've yet to
solve.


> Attila.


Randall Schulz

===================================
This list is hosted by DevelopMentor®  http://www.develop.com

View archives and manage your subscription(s) at http://discuss.develop.com