Re: Out-of-Memory Handling in Long-Running / Server Applications
Carfield Yim <[email protected]> Wed, 16 Apr 2008 01:01:43 +0800
| Newsgroups | gmane.comp.windows.devel.java.advanced |
|---|---|
| Message-ID | <[email protected]> |
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? > Compared to allocating a > > really huge heap (bigger than physical RAM), you could gain some more > > control over when swapping out to disk occurs, but whether or not you > > could do a significantly better job than the OS's default algorithm > > is debatable. > > > 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 ? =================================== This list is hosted by DevelopMentorĀ® http://www.develop.com View archives and manage your subscription(s) at http://discuss.develop.com