From owner-freebsd-hackers Sat Nov 9 18:45:42 1996 Return-Path: owner-hackers Received: (from root@localhost) by freefall.freebsd.org (8.7.5/8.7.3) id SAA05877 for hackers-outgoing; Sat, 9 Nov 1996 18:45:42 -0800 (PST) Received: from quagmire.ki.net (root@quagmire.ki.net [205.150.102.1]) by freefall.freebsd.org (8.7.5/8.7.3) with ESMTP id SAA05872 for ; Sat, 9 Nov 1996 18:45:37 -0800 (PST) Received: from localhost (scrappy@localhost) by quagmire.ki.net (8.8.2/8.7.5) with SMTP id VAA14291 for ; Sat, 9 Nov 1996 21:45:54 -0500 (EST) Date: Sat, 9 Nov 1996 21:45:52 -0500 (EST) From: "Marc G. Fournier" To: hackers@freebsd.org Subject: semaphores/shared memory Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-hackers@freebsd.org X-Loop: FreeBSD.org Precedence: bulk Hi again... I have a copy of Unix Network Programming, and am working on designing a server-client system where there is one server and X clients that are talking to it, using shared memory. according to the book, I'm looking at using semaphores for the IPC, and the general concepts of semaphores presented makes sense...but it seems to only allow for a 1-1 relationship, vs a 1-many relationship. can anyone suggestion a reference that goes a bit deeper into shared memory/semaphores that might give me a better idea of a 1-many relationship, if possible? essentially, I want the server to write a line of data to shared memory, then signal all the clients at once that the data is there, so that they all pick up the data... Marc G. Fournier scrappy@ki.net Systems Administrator @ ki.net scrappy@freebsd.org