* Question about RTS implementations
@ 1991-04-10 15:41 offer
0 siblings, 0 replies; only message in thread
From: offer @ 1991-04-10 15:41 UTC (permalink / raw)
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1991-04-10 15:41 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1991-04-10 15:41 Question about RTS implementations offer
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox