Path: utzoo!mnetor!tmsoft!torsqnt!jarvis.csri.toronto.edu!rutgers!ucsd!ames!sun-barr!cs.utexas.edu!usc!sdsu!genbank!agate!saturn!scott@cs.rochester.edu
From: scott@cs.rochester.edu (Michael Scott)
Newsgroups: comp.os.research
Subject: Re: message-passing vs shared memory
Message-ID: <9774@saturn.ucsc.edu>
Date: 15 Nov 89 14:36:11 GMT
Sender: usenet@saturn.ucsc.edu
Organization: University of Rochester Computer Science Department
Lines: 43
Approved: comp-os-research@jupiter.ucsc.edu

In article <9745@saturn.ucsc.edu> mendozag@ee.ecn.purdue.edu (Victor M Mendoza-Grado) writes:
| 
|  I am trying to recall the reference where the set of primitives
|  for message-passing and for shared memory mechanisms are shown
|  to be equivalent in power. I that thought maybe someone in the net
|  can lend a hand, which I'll appreciate very much.
|   
|  I barely remember it was included in one of the LNCS volumes,
|  but I might be wrong.
| 
|    Thanks in advance
| 
|    Victor M. Grado
|    mendozag@ecn.purdue.edu

You're probably refering to the classic Lauer and Needham paper:

%A H. C. Lauer
%A R. M. Needham
%T On the Duality of Operating System Structures
%J ACM Operating Systems Review
%V 13
%N 2
%P 3-19
%D April 1979
%O Originally presented at the \f2Second International Symposium on Operating
Systems\fP, October 1978

You might also be interested in a little technical note I wrote back when
I was a grad student:

%A M. L. Scott
%T Messages v. Remote Procedures is a False Dichotomy
%J ACM SIGPLAN Notices
%V 18
%N 5
%D May 1983
%P 57-62
-- 
Michael L. Scott
University of Rochester    (716) 275-7745
scott@cs.rochester.edu     scott%rochester@CSNET-RELAY
{decvax, allegra, cmcl2}!rochester!scott