From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,5dc0152fc17e5f2c,start
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news2.google.com!fu-berlin.de!uni-berlin.de!not-for-mail
From: "Nick Roberts" <nick.roberts@acm.org>
Newsgroups: comp.lang.ada
Subject: Deadlock resolution
Date: Mon, 26 Jul 2004 04:25:47 +0100
Message-ID: <opsbp6g9xzp4pfvb@bram-2>
Mime-Version: 1.0
Content-Type: text/plain; format=flowed; delsp=yes; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
X-Trace: news.uni-berlin.de ICg4+7OX/+unIY/vT+bDYggyQIdQ30xhUwuHazu8xTAUM5S4Q=
User-Agent: Opera M2/7.51 (Win32, build 3798)
Xref: g2news1.google.com comp.lang.ada:2387
Date: 2004-07-26T04:25:47+01:00
List-Id: <comp.lang.ada>

I would appreciate answers from people who have experience
of real life multi-tasking software written in Ada.

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)?

Alternatively, have you ever come across software written
in Ada using techniques to eliminate deadlock (for example,
a lock ordering strategy)?

Which approach do you think is best, in reality (handle in
Ada, handle elsewhere, eliminate altogether)?

I would appreciate brief descriptions of how deadlock
detection and/or resolution is performed in real Ada
programs (where it is performed in Ada).

-- 
Thanks,
Nick Roberts