comp.lang.ada
 help / color / mirror / Atom feed
From: "Nick Roberts" <nick.roberts@acm.org>
Subject: Re: Deadlock resolution
Date: Tue, 27 Jul 2004 16:31:14 +0100
Date: 2004-07-27T16:31:14+01:00	[thread overview]
Message-ID: <opsbsyqccpp4pfvb@bram-2> (raw)
In-Reply-To: m3acxnp5w7.fsf@0x5358ef10.boanxx18.adsl-dhcp.tele.dk

On 26 Jul 2004 09:46:48 +0200, Mark Lorenzen <mark.lorenzen@ofir.dk> wrote:

>> Does this software tend to have deadlock detection and/or
>> resolution mechanisms explicitly programmed in Ada, or is
>> it expected that deadlocks will be managed elsewhere (for
>> example, in the operating system or run time system or
>> RTMS or whatever)?
>
> I would say that it should be managed elsewhere preferably
> by hardware.

I have never come across hardware that does deadlock
detection or resolution. Is there any information about this
on the Internet?

>> Alternatively, have you ever come across software written
>> in Ada using techniques to eliminate deadlock (for example,
>> a lock ordering strategy)?
>
> Use one of the normal analysis methods to analyse if your
> tasks always meet their deadlines f.x. the Rate Monotonic
> Analysis method (see "Meeting Deadlines in Hard Real-Time
> Systems" ISBN: 0-8186-7406-7) together with the Ravenscar
> Ada profile.

Although I did not mention it (sorry), I am not really
thinking about hard real time systems. The kind of systems I
am most interested in are soft real time (non-embedded
network server, technical workstation, office desktop).

Although many of the same basic principles apply, it is often
the case that the economics are slightly different. But
perhaps this doesn't matter?

>> Which approach do you think is best, in reality (handle in
>> Ada, handle elsewhere, eliminate altogether)?
>
> Eliminate deadlocks in the first place is the best
> solution. Everything else is just a hack trying to fix a
> bad design.

That is quite true, but deadlock handling is a bit like
exception handling, in that it can form the braces of a belt-
and-braces approach. Is deadlock elimination realistic for
all kinds of software?

>> I would appreciate brief descriptions of how deadlock
>> detection and/or resolution is performed in real Ada
>> programs (where it is performed in Ada).
>
> In some systems, a watchdog is monitoring the CPU to detect
> if it halts and then resets the system. But again, avoiding
> deadlocks is better than resetting the system.

Is it necessary for the watchdog to reset the whole system,
or just to kill one of the tasks/threads participating in the
cycle of deadlock?

-- 
Thanks again,
Nick Roberts



  reply	other threads:[~2004-07-27 15:31 UTC|newest]

Thread overview: 18+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2004-07-26  3:25 Deadlock resolution Nick Roberts
2004-07-26  7:46 ` Mark Lorenzen
2004-07-27 15:31   ` Nick Roberts [this message]
2004-07-28  9:34     ` Mark Lorenzen
2004-07-28 13:53       ` Nick Roberts
2004-07-28 14:21         ` Dmitry A. Kazakov
2004-08-02 11:00     ` Ole-Hjalmar Kristensen
2004-07-26  7:48 ` Jano
2004-07-27 15:33   ` Nick Roberts
2004-07-27 16:52     ` Jano
2004-07-28 14:14       ` Nick Roberts
2004-07-29  1:04         ` Randy Brukardt
2004-07-26 14:05 ` Marc A. Criley
2004-07-27 15:50   ` Nick Roberts
2004-07-27 17:31     ` Marc A. Criley
2004-07-27 21:29       ` Robert I. Eachus
2004-07-28 14:29         ` Nick Roberts
2004-07-27 17:53 ` Martin Dowie
replies disabled

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