Question about RTS implementations

Question about RTS implementations

[offer]

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