On interprocess communication
Distributed ComputingPublished 1 June 1986
Leslie Lamport
Citations307
SJR quartileQ1
SJR score0.81
SNIP1.21
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The formalism developed in Part I is used in proving the correctness of several constructions given for implementing one class of register with a weaker class in Interprocess communication.
Abstract
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.
Keywords
Computer ScienceEngineering
Distributed ComputingOn interprocess communication
841 Citations1986Leslie Lamport
In Part II, the formalism is used to specify several classes of interprocess communication mechanisms and to prove the correctness of algorithms for implementing them.
Communications of the ACMConcurrent control with “readers” and “writers”
527 Citations1971Pierre Courtois, F. Heymans +1 more
Communications of the ACMConcurrent reading and writing
280 Citations1977Leslie Lamport
Two general theorems are proved, and some algorithms are presented to illustrate their use, including a solution to the general problem in which a read is repeated if it might have obtained an incorrect result, and two techniques for transmitting messages between processes.
ACM Transactions on Programming Languages and SystemsConcurrent Reading While Writing
171 Citations1983Gary L. Peterson
The problem of asynchronous processes reading shared data while the data are being modified by another process is considered and the number of copies used by all algorithms is shown to be the best possible.
ACM Transactions on Programming Languages and SystemsAxioms for memory access in asynchronous hardware systems
134 Citations1986Jayadev Misra