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

On Tuesday 15 April 2008 10:01, Carfield Yim wrote:
> On 4/15/08, Randall R Schulz <[email protected]> wrote:
> > On Monday 14 April 2008 13:01, Bob Lee wrote:
> > > On Mon, Apr 14, 2008 at 11:17 AM, Randall R Schulz
> > > <[email protected]>
> > >
> > > wrote:
> > > > Yes. It's a heap-based priority queue (where "heap" is meant in
> > > > the sense of the heap data structure, not in the sense of a
> > > > dynamic allocation pool.)
> > >
> > > You could actually back that with a file.
> >
> > To what end?
>
> Nowaday an HDD can be 1 TB big, even that is not enough?

It's not about space, it's about speed.


> > ...
> >
> > The access patterns are such that to achieve anything near
> > acceptable performance, the tree and the priority queue must remain
> > in the working set.
>
> How about http://en.wikipedia.org/wiki/Solid-state_drive ?

I eagerly await them. Until they're price-competitive with rotating
magnetic media, I won't be using them.


But I can't really believe that people are suggesting that a tight inner
loop of my program should be rewritten to directly and explicitly use
secondary storage.


Randall Schulz

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

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