ON INTERPROCESS COMMUNICATION .2. ALGORITHMS

被引：140

作者：

LAMPORT, L ^{[1
]}

机构：

[1] SRI INT,COMP SCI LAB,MENLO PK,CA 94025

来源：

DISTRIBUTED COMPUTING | 1986年 / 1卷 / 02期

关键词：

COMPUTER PROGRAMMING - Algorithms - DATABASE SYSTEMS - Distributed;

D O I：

10.1007/BF01786228

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：86 / 101

页数：16

共 6 条

[1]

COURTOIS PJ, 1971, COMMUN ACM, V14, P190

[2] CONCURRENT READING AND WRITING [J].

LAMPORT, L .

COMMUNICATIONS OF THE ACM, 1977, 20 (11) :806-811

[3] ON INTERPROCESS COMMUNICATION .1. BASIC FORMALISM [J].

LAMPORT, L .

DISTRIBUTED COMPUTING, 1986, 1 (02) :77-85

[4]

Lamport L., 1985, INTERPROCESS COMMUNI

[5] AXIOMS FOR MEMORY ACCESS IN ASYNCHRONOUS HARDWARE SYSTEMS [J].

MISRA, J .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1986, 8 (01) :142-153

[6] CONCURRENT READING WHILE WRITING [J].

PETERSON, GL .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :46-55

← 1 →