Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!snorkelwacker.mit.edu!bu.edu!inmet!offer
From: offer@inmet.inmet.com
Newsgroups: comp.lang.ada
Subject: Question about RTS implementations
Message-ID: <20600097@inmet>
Date: 10 Apr 91 15:41:00 GMT
Lines: 18
Nf-ID: #N:inmet:20600097:000:726
Nf-From: inmet.inmet.com!offer    Apr 10 11:41:00 1991


I would like to get some feedback from vendors regarding the following
RTS implementation issue.  I am basically interested in real 
implementation techniques (whenever it's not proprietary) and not so
much in theoretical solutions.

Masters in Ada may be created dynamically; usually there is no way
to know the number of possible masters at task creation time
(nested declare blocks, etc.)  Since masters are both head-of-chains
and members in chains, there is ususally the need to dynamically allocate 
one object per each new master.

Most RTS's (particularly, those for real-time) try to eliminate
or minimize the need for the RTS to do dynamic memory allocation

So, are there any clever tricks out there ?

Offer Pazy