Return to BSD News archive
Path: sserve!newshost.anu.edu.au!munnari.oz.au!constellation!aardvark.ucs.uoknor.edu!ns1.nodak.edu!netnews.nwnet.net!news.clark.edu!spool.mu.edu!howland.reston.ans.net!xlink.net!news.dfn.de!server2.rz.uni-leipzig.de!RNEWS.urz.tu-dresden.de!irz401!uriah!not-for-mail
Newsgroups: comp.os.386bsd.questions
Subject: A question about process synchronization...
Message-ID: <27u625INNpn6@bonnie.tcd-dresden.de>
From: alf@bonnie.tcd-dresden.de (Alfredo Herrera)
Date: 24 Sep 1993 09:02:29 +0200
Organization: Textil Computer Design GmbH Dresden, Germany
Keywords: messages, ipc, semaphores
NNTP-Posting-Host: bonnie.tcd-dresden.de
Lines: 18
The writer-reader-problem can be solved quite elegant and
efficient using the implentation of Dijkstra's semaphores on SYSV.4.
I'm an admirer of BSD, but for this problem I've missed this here!
The equivalence between semaphores, messages, monitors and other
synchronization primitives is known to me.
My question: What is the best (most efficient) solution for this
kind of problems under BSD? The cost of messages transmissions seems
to be to high. Have anyone an idea? Or, Can anyone clarify me?
Thanks in advance,
_____________________________________________________________________
Alfredo Herrera Hernandez Textil Computer Design GmbH
alf@tcd-dresden.de, alf@uriah.sax.de Dresden, Germany
--
_____________________________________________________________________
Alfredo Herrera Hernandez Textil Computer Design GmbH
alf@tcd-dresden.de, alf@uriah.sax.de Dresden, Germany