comp.lang.ada
 help / color / mirror / Atom feed
From: Brian Rogoff <bpr@shell5.ba.best.com>
Subject: Re: Memory Management Algorithms for Hard Realtime
Date: 1998/02/18
Date: 1998-02-18T00:00:00+00:00	[thread overview]
Message-ID: <Pine.BSF.3.96.980218180000.21268A-100000@shell5.ba.best.com> (raw)
In-Reply-To: gwinn-1802981847520001@dh5055200.res.ray.com


On Wed, 18 Feb 1998, Joe Gwinn wrote:
> In article <dewar.887767452@merv>, dewar@merv.cs.nyu.edu (Robert Dewar) wrote:
> > The book you talk about is, if we believe its title, about *automatic*
> > memory management. 
> > 
> > There are many algorithms for allocating variable sized blocks with
> > *manual* allocation/release control that have well defined worst
> > case behavior.
> 
> I wasn't planning to come along in a missile running the memory management
> system, so automatic seems best.  What am I missing?

Automatic memory management = garbage collection, i.e., all freeing
operations are done by *implicitly* by the runtime, so there are no
explicit calls to free/Unchecked_Deallocation. Read the book, and this
will become clear.

Manual memory management is where you the programmer must explicitly
invoke some freeing operation to return memory that you've allocated.
It doesn't mean that you interactively free memory from a running program,
as you seem to suggest. Its what you're doing now, if you are using fixed 
size block allocators.

-- Brian






  reply	other threads:[~1998-02-18  0:00 UTC|newest]

Thread overview: 5+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
1998-02-17  0:00 Memory Management Algorithms for Hard Realtime Joe Gwinn
1998-02-17  0:00 ` Robert Dewar
1998-02-18  0:00   ` Joe Gwinn
1998-02-18  0:00     ` Brian Rogoff [this message]
1998-02-19  0:00     ` Nick Roberts
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox