* ANNOUNCE: static locking order article posted to ACM archives
@ 1999-04-10 0:00 Matthew Heaney
0 siblings, 0 replies; only message in thread
From: Matthew Heaney @ 1999-04-10 0:00 UTC (permalink / raw)
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1999-04-10 0:00 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1999-04-10 0:00 ANNOUNCE: static locking order article posted to ACM archives Matthew Heaney
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox