Re: Counting semaphores?

Article View: comp.os.os2.programmer

Article #1595

Back to comp.os.os2.programmer Previous Next

#1595

From: lsalomo
Date: Mon, 29 Oct 1990 14:39

16 lines
1105 bytes

From article <90Oct26.163804edt.8236@orasis.vis.toronto.edu>, by green@vis.toronto.edu (Anthony Thomas Green):
> Is it possible to set up a system semaphore that must be cleared as many
> times as it has been set in order for a waiting thread to become
> runnable?

I always thought that's the way RAM semaphores were implemented?

Cheers,
Q - the "Q"uestor for knowledge (, a degree, etc.)

lsalomo@hubcap.clemson.edu
ibmman@prism.clemson.edu
ibmman@clemson.clemson.edu
=============================================================================
"Gee Wally, I think there's something wrong with the Beaver."
=============================================================================

Technical Details

Message-ID: <11219@hubcap.clemson.edu>

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!emory!hubcap!lsalomo

References: <90Oct26.163804edt.8236@orasis.vis.toronto.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!emory!hubcap!lsalomo
From: lsalomo@hubcap.clemson.edu (lsalomo)
Newsgroups: comp.os.os2.programmer
Subject: Re: Counting semaphores?
Message-ID: <11219@hubcap.clemson.edu>
Date: 29 Oct 90 14:39:02 GMT
References: <90Oct26.163804edt.8236@orasis.vis.toronto.edu>
Organization: Clemson University, Clemson, SC
Lines: 16

Reply to Parent Message