From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4045dbe1801294bc
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Memory Management Algorithms for Hard Realtime
Date: 1998/02/17
Message-ID: <dewar.887767452@merv>#1/1
X-Deja-AN: 326069929
References: <gwinn-1702981912510001@dh5055083.res.ray.com>
X-Complaints-To: usenet@news.nyu.edu
X-Trace: news.nyu.edu 887767640 23700 (None) 128.122.140.58
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1998-02-17T00:00:00+00:00
List-Id: <comp.lang.ada>


Joe said

<<The clear conclusion of this book is that there are no hard realtime
memory manager algorithms known, unless one resorts to special hardware.
The authors are university professors who have studied the field, with a
377-page book to show for it.  This lack of suitable algorithms has
certainly been my personal experience as well, and is why I always
doggedly stuck to fixed-block allocators.
>>

That's a non-sequitur.

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.

Nothing you summarize in the rest of your message even hints that
this is not the case!