Date: Wed, 13 Sep 2000 06:19:10 +0900 From: "Daniel C. Sobral" <dcs@newsguy.com> To: Jason Evans <jasone@canonware.com> Cc: Matthew Jacob <mjacob@feral.com>, arch@FreeBSD.ORG Subject: Re: Necessary synchronization primitives (was Re: cvs commit: [...] yarrow.c [...]) Message-ID: <39BE9DCE.857D2310@newsguy.com> References: <20000912161928.C23948@wantadilla.lemis.com> <Pine.BSF.4.21.0009120012350.70592-100000@beppo.feral.com> <20000912113445.F31089@blitz.canonware.com>
next in thread | previous in thread | raw e-mail | index | archive | help
Jason Evans wrote: > > * Dijkstra semaphore > > I've gone through my library (including Knuth and various other books) > and the best I've been able to determine is that Dijkstra semaphores have > two operations: P (passeren: Dutch for "to pass") and V (vrijgeven: Dutch > for "to give free"). It is unclear to me given the references at hand > whether Dijkstra semaphores are generalized enough to include a count > like counting semaphores (described below), but I suspect so. Perhaps > Greg can shed some light on that. The original Dijkstra algorithm is a mutex, pure and simple. The counting semaphores comes from elsewhere. -- Daniel C. Sobral (8-DCS) dcs@newsguy.com dcs@freebsd.org capo@white.bunnies.bsdconspiracy.net OK, so the solar flares are my fault.. I am sorry, ok?!?! To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-arch" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?39BE9DCE.857D2310>