AN OPTIMAL ALGORITHM FOR DISTRIBUTED SNAPSHOTS WITH CAUSAL MESSAGE ORDERING

被引：17

作者：

ALAGAR, S

VENKATESAN, S

机构：

[1] Univ of Texas at Dallas, Richardson, United States

来源：

INFORMATION PROCESSING LETTERS | 1994年 / 50卷 / 06期

基金：

美国国家科学基金会;

关键词：

DISTRIBUTED SYSTEMS; GLOBAL STATES; CAUSAL ORDERING; MESSAGE COMPLEXITY;

D O I：

10.1016/0020-0190(94)00055-7

中图分类号：

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

学科分类号：

0812 ;

摘要：

We present an optimal distributed algorithm to record a global state of a distributed system with causally ordered message delivery. The message complexity of our algorithm is O(n) bits where n is the number of processes in the system.

引用

页码：311 / 316

页数：6

共 9 条

[1] RECORDING DISTRIBUTED SNAPSHOTS BASED ON CAUSAL ORDER OF MESSAGE DELIVERY [J].

ACHARYA, A ;

BADRINATH, BR .

INFORMATION PROCESSING LETTERS, 1992, 44 (06) :317-321

[2] FLUSH PRIMITIVES FOR ASYNCHRONOUS DISTRIBUTED SYSTEMS [J].

AHUJA, M .

INFORMATION PROCESSING LETTERS, 1990, 34 (01) :5-12

[3]

BIRMAN K, 1991, ACM T COMPUT SYST, V9, P272, DOI 10.1145/128738.128742

[4] DISTRIBUTED SNAPSHOTS - DETERMINING GLOBAL STATES OF DISTRIBUTED SYSTEMS [J].

CHANDY, KM ;

LAMPORT, L .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1985, 3 (01) :63-75

[5] ON DISTRIBUTED SNAPSHOTS [J].

LAI, TH ;

YANG, TH .

INFORMATION PROCESSING LETTERS, 1987, 25 (03) :153-158

[6] TIME, CLOCKS, AND ORDERING OF EVENTS IN A DISTRIBUTED SYSTEM [J].

LAMPORT, L .

COMMUNICATIONS OF THE ACM, 1978, 21 (07) :558-565

[7] THE CAUSAL ORDERING ABSTRACTION AND A SIMPLE WAY TO IMPLEMENT IT [J].

RAYNAL, M ;

SCHIPER, A ;

TOUEG, S .

INFORMATION PROCESSING LETTERS, 1991, 39 (06) :343-350

[8]

SCHIPER A, 1989, 3RD P INT WORKSH DIS, P219

[9]

VENKATESH K, 1987, 7TH P INT C DISTR CO, P364

← 1 →