ASYNCHRONOUS CONSENSUS AND BROADCAST PROTOCOLS

被引：262

作者：

BRACHA, G

TOUEG, S

机构：

[1] Cornell Univ, Dep of Computer, Science, Ithaca, NY, USA, Cornell Univ, Dep of Computer Science, Ithaca, NY, USA

来源：

JOURNAL OF THE ACM | 1985年 / 32卷 / 04期

关键词：

COMPUTER SYSTEMS; DIGITAL; -; Distributed;

D O I：

10.1145/4221.214134

中图分类号：

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

学科分类号：

0812 ;

摘要：

A consensus protocol enables a system of n asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes that can only die and malicious processes than can also send false messages. The class of asynchronous systems with fair schedulers is defined, and consensus protocols that terminate with probability 1 for these systems are investigated. The possibility of reliable broadcast (Byzantine Agreement) in asynchronous systems is also investigated.

引用

页码：824 / 840

页数：17

共 9 条

[1]

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

[2]

Dolev D., 1981, 22nd Annual Symposium on Foundations of Computer Science, P159, DOI 10.1109/SFCS.1981.53

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

FISCHER, MJ ;

LYNCH, NA ;

PATERSON, MS .

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

[4]

ISAACSON DL, 1976, MARKOV CHAINS THEORY, P89

[5]

Itai A., 1981, 22nd Annual Symposium on Foundations of Computer Science, P150, DOI 10.1109/SFCS.1981.41

[6] THE BYZANTINE GENERALS PROBLEM [J].

LAMPORT, L ;

SHOSTAK, R ;

PEASE, M .

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

[7] REACHING AGREEMENT IN THE PRESENCE OF FAULTS [J].

PEASE, M ;

SHOSTAK, R ;

LAMPORT, L .

JOURNAL OF THE ACM, 1980, 27 (02) :228-234

[8]

RABIN MO, 1981, 8 POPL, P133

[9] FAIL-STOP PROCESSORS - AN APPROACH TO DESIGNING FAULT-TOLERANT COMPUTING SYSTEMS [J].

SCHLICHTING, RD ;

SCHNEIDER, FB .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1983, 1 (03) :222-238

← 1 →