REACHING APPROXIMATE AGREEMENT IN THE PRESENCE OF FAULTS

被引：292

作者：

DOLEV, D

LYNCH, NA

PINTER, SS

STARK, EW

WEIHL, WE

机构：

[1] MIT,DEPT ELECT ENGN & COMP SCI,CAMBRIDGE,MA 02139

[2] SUNY STONY BROOK,DEPT COMP SCI,STONY BROOK,NY 11794

[3] TECHNION,HAIFA,ISRAEL

来源：

JOURNAL OF THE ACM | 1986年 / 33卷 / 03期

关键词：

D O I：

10.1145/5925.5931

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：499 / 516

页数：18

共 12 条

[1]

BENOR M, 1983, 2ND P ANN ACM S PRIN, P27

[2] ASYNCHRONOUS CONSENSUS AND BROADCAST PROTOCOLS [J].

BRACHA, G ;

TOUEG, S .

JOURNAL OF THE ACM, 1985, 32 (04) :824-840

[3]

BRACHA G, 1984, 3RD P ANN ACM S PRIN, P154

[4]

Dolev D., 1983, 24th Annual Symposium on Foundations of Computer Science, P393, DOI 10.1109/SFCS.1983.41

[5]

DOLEV D, 1982, 14TH P ACM S THEOR C, P401

[6]

DOLEV D, 1983, 3 S REL DISTR SOFTW, P145

[7]

FISCHER M, 1986, DISTR COMPUT, V1, P1

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

FISCHER, MJ ;

LYNCH, NA .

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

[9] IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS [J].

FISCHER, MJ ;

LYNCH, NA ;

PATERSON, MS .

JOURNAL OF THE ACM, 1985, 32 (02) :374-382

[10] THE BYZANTINE GENERALS PROBLEM [J].

LAMPORT, L ;

SHOSTAK, R ;

PEASE, M .

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

← 1 2 →