USING TIME INSTEAD OF TIMEOUT FOR FAULT-TOLERANT DISTRIBUTED SYSTEMS

被引：117

作者：

LAMPORT, L

机构：

来源：

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1984年 / 6卷 / 02期

关键词：

D O I：

10.1145/2993.2994

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：254 / 280

页数：27

共 14 条

[1] THE BYZANTINE GENERALS STRIKE AGAIN [J].

DOLEV, D .

JOURNAL OF ALGORITHMS, 1982, 3 (01) :14-30

[2]

DOLEV D, UNPUB SIAM J COMPUT

[3] NOTIONS OF CONSISTENCY AND PREDICATE LOCKS IN A DATABASE SYSTEM [J].

ESWARAN, KP ;

GRAY, JN ;

LORIE, RA ;

TRAIGER, IL .

COMMUNICATIONS OF THE ACM, 1976, 19 (11) :624-633

[4] A LOWER BOUND FOR THE TIME TO ASSURE INTERACTIVE CONSISTENCY [J].

FISCHER, MJ ;

LYNCH, NA .

INFORMATION PROCESSING LETTERS, 1982, 14 (04) :183-186

[5]

FISCHER MJ, 1982, MITLCSTR282 TECH REP

[6] IMPLEMENTATION OF RELIABLE DISTRIBUTED MULTIPROCESS SYSTEMS [J].

LAMPORT, L .

COMPUTER NETWORKS AND ISDN SYSTEMS, 1978, 2 (02) :95-114

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

LAMPORT, L .

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

[8] THE BYZANTINE GENERALS PROBLEM [J].

LAMPORT, L ;

SHOSTAK, R ;

PEASE, M .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03) :382-401

[9]

LAMPORT L, UNPUB SYNCHRONIZING

[10]

LYNCH NA, 1982, 2ND P S REL DISTR SO

← 1 2 →