* Non-deterministic reactivation
@ 1996-09-26 0:00 Arnold Putong
0 siblings, 0 replies; only message in thread
From: Arnold Putong @ 1996-09-26 0:00 UTC (permalink / raw)
Hi Everyone!
I'm just exploring Ada tasks. One author said that suspended message
senders are not put in a FIFO queue and when a task entry becomes open it
chooses _non-deterministically_ among the suspended senders for
reactivation. The rationale behind this was that it somehow reduces the
probability of deadlocks.
I have tried to imagine scenarios wherein this non-deterministic
approach, instead of first-suspended-first-reactivated approach, does
indeed prevent a deadlock but have failed.
Can some guru's out there know of one simple example?
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1996-09-26 0:00 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1996-09-26 0:00 Non-deterministic reactivation Arnold Putong
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox