THE CAUSAL ORDERING ABSTRACTION AND A SIMPLE WAY TO IMPLEMENT IT

被引：100

作者：

RAYNAL, M

SCHIPER, A

TOUEG, S

机构：

[1] ECOLE POLYTECH FED LAUSANNE,DEPT INFORMAT,CH-1015 LAUSANNE,SWITZERLAND

[2] CORNELL UNIV,DEPT COMP SCI,ITHACA,NY 14853

来源：

INFORMATION PROCESSING LETTERS | 1991年 / 39卷 / 06期

关键词：

DISTRIBUTED COMPUTING; DISTRIBUTED ALGORITHM; CAUSAL ORDERING; NETWORK PROTOCOL;

D O I：

10.1016/0020-0190(91)90008-6

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Control in distributed systems is mainly introduced to reduce nondeterminism. This nondeterminism is due on the one hand to the asynchronous execution of the processes located on the various sites of the system, and on the other hand to the asynchronous nature of the communication channels. In order to limit the asynchronism due to the communication channels, a new message ordering relation, known as causal ordering, has been introduced by Birman and Joseph. After giving some examples of this causal ordering, we propose a simple algorithm to implement it. This algorithm is based on message sequence numbering. A proof of the correctness of the algorithm is also given.

引用

页码：343 / 350

页数：8