THE MANY FACES OF CONSENSUS IN DISTRIBUTED SYSTEMS

被引:51
作者
TUREK, J [1 ]
SHASHA, D [1 ]
机构
[1] NYU,COURANT INST,NEW YORK,NY 10003
基金
美国国家科学基金会;
关键词
D O I
10.1109/2.153253
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:8 / 17
页数:10
相关论文
共 12 条
[1]   FAST RANDOMIZED CONSENSUS USING SHARED MEMORY [J].
ASPNES, J ;
HERLIHY, M .
JOURNAL OF ALGORITHMS, 1990, 11 (03) :441-461
[2]  
ASPNES J, 1990, 9TH P ACM C PRINC DI, P325
[3]  
ATTIYA H, 1990, 9TH P ANN ACM S PRIN, P363
[4]  
Bernstein Philip A., 1987, CONCURRENCY CONTROL
[5]  
BIRMAN K, 1989, TR891014 CORN U DEP
[6]   ON THE MINIMAL SYNCHRONISM NEEDED FOR DISTRIBUTED CONSENSUS [J].
DOLEV, D ;
DWORK, C ;
STOCKMEYER, L .
JOURNAL OF THE ACM, 1987, 34 (01) :77-97
[7]   AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT [J].
DOLEV, D ;
STRONG, HR .
SIAM JOURNAL ON COMPUTING, 1983, 12 (04) :656-666
[8]   EASY IMPOSSIBILITY PROOFS FOR DISTRIBUTED CONSENSUS PROBLEMS [J].
FISCHER, MJ ;
LYNCH, NA ;
MERRITT, M .
DISTRIBUTED COMPUTING, 1986, 1 (01) :26-39
[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]  
GIFFORD DK, 1979, 7TH P S OP SYST PRIN, P150