comp.lang.ada
 help / color / mirror / Atom feed
From: WILSON@amstel.llnl.gov (One Heppy Heppy 'Ket')
Subject: Task reuse
Date: 1 Mar 90 01:54:00 GMT	[thread overview]
Message-ID: <9003010229.AA02234@ajpo.sei.cmu.edu> (raw)

Fred Zwarts asked about UNCHECKED_DEALLOCATION on task access types.

Mats Weber and Norman Cohen correctly responded that there is not necessarily
any effect.  Norman suggested that "good" compilers will reclaim the storage
occupied by a terminated task.  I don't know how good this really is, since I
can't rely on it from one compiler to the next, or ever from one version of a
compiler to the next!  In fact, a compiler which supports this can mask 
program bugs which might turn up at porting time.

I think that with the current Ada spec, Mats has the only right answer, which is
to maintain a task pool, and "manually" keep track of which tasks have completed
their basic function, in order to reuse them.

This seems to be a pretty general need in the Ada environment.  I am wondering
if anyone has written any generic packages which support this task pool
concept?  I've designed a few, but they've always come out too tightly coupled
to the task body's rendezvous algorithm.  Has anyone else solved this problem
in general terms, or worse, proven that it can't be solved?

			--- Rick Wilson

             reply	other threads:[~1990-03-01  1:54 UTC|newest]

Thread overview: 2+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
1990-03-01  1:54 One Heppy Heppy 'Ket' [this message]
1990-03-01 20:16 ` Task reuse Robert I. Eachus
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox