Wait-free Byzantine consensus

被引：3

作者：

Attie, P ^{[1
]}

机构：

[1] Northeastern Univ, Coll Comp Sci, MIT, Comp Sci Lab, Boston, MA 02115 USA

来源：

INFORMATION PROCESSING LETTERS | 2002年 / 83卷 / 04期

关键词：

distributed computing; fault tolerance; wait-freedom;

D O I：

10.1016/S0020-0190(01)00334-9

中图分类号：

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

学科分类号：

0812 ;

摘要：

The problem of devising wait-free shared memory consensus protocols which tolerate Byzantine processes was studied. The approach was restricted to faults that affect the processes and the shared memory was assumed to be reliable. Results showed that the weak wait-free Byzantine consensus could be achieved only by using 'nonresettable' objects.

引用

页码：221 / 227

页数：7

共 11 条

[1]

ATTIE PC, 2000, NUCCS0002

[2] BOUNDS ON THE TIME TO REACH AGREEMENT IN THE PRESENCE OF TIMING UNCERTAINTY [J].

ATTIYA, H ;

DWORK, C ;

LYNCH, N ;

STOCKMEYER, L .

JOURNAL OF THE ACM, 1994, 41 (01) :122-152

[3] CONSENSUS IN THE PRESENCE OF PARTIAL SYNCHRONY [J].

DWORK, C ;

LYNCH, N ;

STOCKMEYER, L .

JOURNAL OF THE ACM, 1988, 35 (02) :288-323

[4] WAIT-FREE SYNCHRONIZATION [J].

HERLIHY, M .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1991, 13 (01) :124-149

[5] Fault-tolerant wait-free shared objects [J].

Jayanti, P ;

Chandra, TD ;

Toueg, S .

JOURNAL OF THE ACM, 1998, 45 (03) :451-500

[6]

Lynch N. A., 1996, DISTRIBUTED ALGORITH

[7]

MALKHI D, 2000, P 14 INT S DISTR COM, P345

[8]

Pfleeger C. P., 1989, SECURITY COMPUTING

[9]

Plotkin S. A., 1989, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, P159, DOI 10.1145/72981.72992

[10]

SILBERSCHATZ A, 1994, OPERATING SYSTEMS CO

← 1 2 →