Distributed Computing

, Volume 1, Issue 2, pp 86–101 | Cite as

On interprocess communication

Part II: Algorithms
  • Leslie Lamport


Interprocess communication is studied without assuming any lower-level communication primitives. Three classes of communication registers are considered, and several constructions are given for implementing one class of register with a weaker class. The formalism developed in Part I is used in proving the correctness of these constructions.


Operating System Communication Network Computer System System Organization Computer Hardware 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Courtois PJ, Heymans F, Parnas DL (1971) Concurrent control with “readers” and “writers”. Commun ACM 14:190–199Google Scholar
  2. 2.
    Lamport L (1977) Concurrent reading and writing. Commun ACM 20:806–811Google Scholar
  3. 3.
    Lamport L (1986) On interprocess communication. Part I: Basic formalism. Distributed Computing 1:77–85Google Scholar
  4. 4.
    Lamport L (1985) Interprocess Communication. SRI Tech RepGoogle Scholar
  5. 5.
    Misra J (1986) Axioms for memory access in asynchronous hardware systems. ACM Trans Program Lang Syst 8:142–153Google Scholar
  6. 6.
    Peterson GL (1983) Concurrent reading while writing. ACM Trans Program Lang Syst 5:46–55Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Leslie Lamport
    • 1
  1. 1.Systems Research CenterDigital Equipment CorporationPalo AltoUSA

Personalised recommendations