Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site princeton.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!princeton!lrr
From: lrr@princeton.UUCP (Larry Rogers)
Newsgroups: net.unix-wizards
Subject: Re: Shared Memory
Message-ID: <1188@princeton.UUCP>
Date: Fri, 20-Dec-85 15:23:38 EST
Article-I.D.: princeto.1188
Posted: Fri Dec 20 15:23:38 1985
Date-Received: Sat, 21-Dec-85 05:33:19 EST
References: <830@brl-tgr.ARPA>
Reply-To: lrr@princeton.UUCP (Larry Rogers)
Organization: Princeton University EECS Dept
Lines: 24
Summary: 


For some ideas on shared memory, messages, and semaphores, I can recommend
the ``Advanced Programmer's Guide to UNIX System V'' available from Osborne/
McGraw-Hill.  I am one of the authors of the book and I wrote the sections
in chapter 7 that describe these things and show examples.

As I read your note, I pondered the problem of sharing linked lists between
processes as the addresses stored in the data structures comprising the
list items cannot have process-specific addresses unless the shared
memory is placed at the same virtual location in each process.  This is
doable when the shared memory is attached, but the processes must
communicate this information (common header files?).  It's an
interesting concept, though.

Larry Rogers
Princeton University
Department of Computer Science
Engineering Quadrangle Building, Room C334
Princeton, NJ 08544

UUCP:	princeton!lrr
CSNET:	lrr%princeton@CSnet-relay
PHONE:	609 452 6483