Consensus in asynchronous distributed systems: A concise guided tour

被引:0
作者
Guerraoui, R [1 ]
Hurfin, M
Mostefaoui, A
Oliveira, R
Raynal, M
Schiper, A
机构
[1] Ecole Polytech Fed Lausanne, Dept Informat, CH-1015 Lausanne, Switzerland
[2] IRISA, F-35042 Rennes, France
来源
ADVANCES IN DISTRIBUTED SYSTEMS: ADVANCED DISTRIBUTED COMPUTING: FROM ALGORITHMS TO SYSTEMS | 2000年 / 1752卷
关键词
asynchronous distributed systems; atomic broadcast; atomic commitment; consensus; crash/no recovery; Crash/Recovery;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is on the Consensus problem. It studies Consensus in two failure models, namely, the Crash/no Recovery,model and the Crash/Recovery model. The assumptions related to the detection of failures that are required to solve Consensus in a given model are particularly emphasized.
引用
收藏
页码:33 / 47
页数:15
相关论文
共 35 条
[1]  
Aguilera MK, 1998, LECT NOTES COMPUT SC, V1499, P231, DOI 10.1007/BFb0056486
[2]  
BOLLO R, 1999, P 4 WORKSH OBJ OR RE
[3]  
Chandra T. D., 1991, Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, P325, DOI 10.1145/112600.112627
[4]  
Chandra T. D., 1992, Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, P147, DOI 10.1145/135419.135451
[5]   Unreliable failure detectors for reliable distributed systems [J].
Chandra, TD ;
Toueg, S .
JOURNAL OF THE ACM, 1996, 43 (02) :225-267
[6]   The weakest failure detector for solving Consensus [J].
Chandra, TD ;
Hadzilacos, V ;
Toueg, S .
JOURNAL OF THE ACM, 1996, 43 (04) :685-722
[7]  
DEFAGO X, 1997, P 17 IEEE S REL DIST, P43
[8]   ON THE MINIMAL SYNCHRONISM NEEDED FOR DISTRIBUTED CONSENSUS [J].
DOLEV, D ;
DWORK, C ;
STOCKMEYER, L .
JOURNAL OF THE ACM, 1987, 34 (01) :77-97
[9]  
DOLEV D, 1996, 961608 CORN U DEP CO
[10]   CONSENSUS IN THE PRESENCE OF PARTIAL SYNCHRONY [J].
DWORK, C ;
LYNCH, N ;
STOCKMEYER, L .
JOURNAL OF THE ACM, 1988, 35 (02) :288-323