From: offer@inmet.inmet.com
Subject: Question about RTS implementations
Date: 10 Apr 91 15:41:00 GMT [thread overview]
Message-ID: <20600097@inmet> (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
reply other threads:[~1991-04-10 15:41 UTC|newest]
Thread overview: [no followups] expand[flat|nested] mbox.gz Atom feed
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox