Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!samsung!zaphod.mps.ohio-state.edu!uwm.edu!ogicse!ucsd!ames!pacbell!indetech!david
From: david@indetech.com (David Kuder)
Newsgroups: comp.arch
Subject: Semaphores without Test&Set instruction
Message-ID: <1990Feb28.014717.16596@indetech.com>
Date: 28 Feb 90 01:47:17 GMT
Reply-To: david@indetech.com (David Kuder)
Organization: Independence Technologies, Inc. Fremont, CA
Lines: 19
Disclaimer: Author bears full responsibility for contents of this article

Some while ago there was some discussion in this news group
about implementing semaphores on machines that did not have
an atomic test and set instruction.  I read the discussion
with some interest but since I had no need for the
algorithm it went into the bit-bucket.

Now I suddenly find myself going from "zero" to "many" on
the "zero, one, many" counting scale.  So rather than
extract a work around from a single vendor I thought I'd
seek out the general solution.  A quick scan of the
references that I have at hand didn't scare up the
algorithm.  Finally, the request:  what is a reference that
gives the algorithm or what does the psuedo code for the
algorithm look like?  E-mail answers and I'll summarize.

Thanks in advance,
-- 
David A. Kuder                                               Now what coach?
415 438-2003  david@indetech.com  {uunet,sun,sharkey,pacbell}!indetech!david