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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 115aec,9dd1d9d2ceca1fab,start
X-Google-Attributes: gid115aec,public
X-Google-Thread: 103376,9dd1d9d2ceca1fab,start
X-Google-Attributes: gid103376,public
From: Matthew Heaney <matthew_heaney@acm.org>
Subject: ANNOUNCE: static locking order article posted to ACM archives
Date: 1999/04/10
Message-ID: <m390c1z0f3.fsf@mheaney.ni.net>#1/1
X-Deja-AN: 464657270
NNTP-Posting-Date: Fri, 09 Apr 1999 19:10:42 PDT
Newsgroups: comp.lang.ada,comp.realtime
Date: 1999-04-10T00:00:00+00:00
List-Id: <comp.lang.ada>

I have posted the article "Static Locking Order" to the April 1999 ACM
patterns archive.

<http://www.acm.org/archives/patterns.html>
<mailto:patterns@acm.org>

"Static locking order" is a technique used to claim exclusive access to
two (or more) resources simultaneously, without possibility of deadlock.

I have translated every C++ example in the GoF Design Patterns book to
Ada95, and have now started documenting idioms for concurrency,
real-time programming, and interprocess communication.

You can subscribe to the ACM patterns list by sending the message (body)

subscribe patterns <your full name>

to the ACM mailing list server.

<mailto:listserv@acm.org>


Matt