Fast Paxos

被引：282

作者：

Lamport, Leslie ^{[1
]}

机构：

[1] Microsoft Res, Mountain View, CA 94043 USA

来源：

DISTRIBUTED COMPUTING | 2006年 / 19卷 / 02期

关键词：

consensus; fault tolerance; distributed algorithms; Paxos;

D O I：

10.1007/s00446-006-0005-x

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

As used in practice, traditional consensus algorithms require three message delays before any process can learn the chosen value. Fast Paxos is an extension of the classic Paxos algorithm that allows the value to be learned in two message delays. How and why the algorithm works are explained informally, and a TLA(+) specification of the algorithm appears as an appendix.

引用

页码：79 / 103

页数：25

共 16 条

[1]

Brasileiro F, 2001, LECT NOTES COMPUT SC, V2127, P42

[2] Practical byzantine fault tolerance and proactive recovery [J].

Castro, M ;

Liskov, B .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04) :398-461

[3]

CHARRONBOST B, UNIFORM CONSENSUS HA

[4]

De Prisco R, 2000, THEOR COMPUT SCI, V243, P35, DOI 10.1016/S0304-3975(00)00042-6

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

FISCHER, MJ ;

LYNCH, NA ;

PATERSON, MS .

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

[6]

Lamport L., 2001, SIGACT News, V32, P51

[7] The part-time parliament [J].

Lamport, L .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1998, 16 (02) :133-169

[8]

LAMPORT L, 2004, MSRTR200471

[9]

LAMPORT L, 2000, WEB 21 LETT STRING O

[10]

LAMPORT L, 1994, INTRO TLA SRC TECHN

← 1 2 →