메뉴 건너뛰기




Volumn , Issue , 2009, Pages 111-120

Fast scalable deterministic consensus for crash failures

Author keywords

Bit communication complexity; Consensus; Fault tolerance; Graph expansion; Message passing; Scalability; Synchrony

Indexed keywords

BINARY INPUTS; COMMUNICATION COMPLEXITY; CONNECTIVITY PROPERTIES; CONSENSUS; CONSENSUS ALGORITHMS; CONSENSUS PROBLEMS; CONSENSUS SOLUTIONS; CRASH FAILURES; GRAPH EXPANSION; MESSAGE PASSING SYSTEMS; NON-FAULTY PROCESS; SYNCHRONY; TIME COMPLEXITY;

EID: 70350641373     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582738     Document Type: Conference Paper
Times cited : (32)

References (27)
  • 1
    • 0012575110 scopus 로고
    • On the message complexity of binary agreement under crash failures
    • S. Amdur, S. Weber, and V. Hadzilacos, On the message complexity of binary agreement under crash failures, Distributed Computing, 5 (1992) 175-186.
    • (1992) Distributed Computing , vol.5 , pp. 175-186
    • Amdur, S.1    Weber, S.2    Hadzilacos, V.3
  • 2
    • 0141610192 scopus 로고    scopus 로고
    • Randomized protocols for asynchronous consensus
    • J. Aspnes, Randomized protocols for asynchronous consensus, Distributed Computing, 16 (2003) 165-175.
    • (2003) Distributed Computing , vol.16 , pp. 165-175
    • Aspnes, J.1
  • 5
    • 0022144724 scopus 로고
    • Asynchronous consensus and broadcast protocols
    • G. Bracha, and S. Toueg, Asynchronous consensus and broadcast protocols, Journal of the ACM, 32 (1985) 824-840.
    • (1985) Journal of the ACM , vol.32 , pp. 824-840
    • Bracha, G.1    Toueg, S.2
  • 8
    • 33845210348 scopus 로고    scopus 로고
    • B.S. Chlebus, and D.R. Kowalski, Time and communication efficient consensus for crash failures, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2006, Springer LNCS 4167, pp. 314-328.
    • B.S. Chlebus, and D.R. Kowalski, Time and communication efficient consensus for crash failures, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2006, Springer LNCS 4167, pp. 314-328.
  • 9
    • 0021976090 scopus 로고
    • Bounds on information exchange for Byzantine agreement
    • D. Dolev, and R. Reischuk, Bounds on information exchange for Byzantine agreement, Journal of the ACM, 32 (1985) 191-204.
    • (1985) Journal of the ACM , vol.32 , pp. 191-204
    • Dolev, D.1    Reischuk, R.2
  • 10
    • 0001280843 scopus 로고    scopus 로고
    • Performing work efficiently in the presence of faults
    • C. Dwork, J. Halpern, and O. Waarts, Performing work efficiently in the presence of faults, SIAM Journal on Computing, 27 (1998) 1457-1491.
    • (1998) SIAM Journal on Computing , vol.27 , pp. 1457-1491
    • Dwork, C.1    Halpern, J.2    Waarts, O.3
  • 11
    • 0031210863 scopus 로고    scopus 로고
    • An optimal probabilistic protocol for synchronous Byzantine agreement
    • P. Feldman, and S. Micali, An optimal probabilistic protocol for synchronous Byzantine agreement, SIAM Journal on Computing, 26 (1997) 873-933.
    • (1997) SIAM Journal on Computing , vol.26 , pp. 873-933
    • Feldman, P.1    Micali, S.2
  • 12
    • 0141854015 scopus 로고    scopus 로고
    • Hundreds of impossibility results for distributed computing
    • F. Fich, and E. Ruppert, Hundreds of impossibility results for distributed computing, Distributed Computing, 16 (2003) 121-163.
    • (2003) Distributed Computing , vol.16 , pp. 121-163
    • Fich, F.1    Ruppert, E.2
  • 13
    • 0000613943 scopus 로고
    • A lower bound for the time to assure interactive consistency
    • M. Fisher, and N. Lynch, A lower bound for the time to assure interactive consistency, Information Processing Letters, 14 (1982) 183-186.
    • (1982) Information Processing Letters , vol.14 , pp. 183-186
    • Fisher, M.1    Lynch, N.2
  • 14
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty process
    • M. Fisher, N. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, 32 (1985) 374-382.
    • (1985) Journal of the ACM , vol.32 , pp. 374-382
    • Fisher, M.1    Lynch, N.2    Paterson, M.3
  • 17
    • 38049011966 scopus 로고    scopus 로고
    • S. Gilbert, R. Guerraoui, and D.R. Kowalski, On the message complexity of indulgent consensus, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2007, Springer LNCS 4731, pp. 283-297.
    • S. Gilbert, R. Guerraoui, and D.R. Kowalski, On the message complexity of indulgent consensus, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2007, Springer LNCS 4731, pp. 283-297.
  • 18
    • 0012575111 scopus 로고
    • Message-optimal protocols for Byzantine agreement
    • V. Hadzilacos, and J.Y. Halpern, Message-optimal protocols for Byzantine agreement, Mathematical Systems Theory, 26 (1993) 41-102.
    • (1993) Mathematical Systems Theory , vol.26 , pp. 41-102
    • Hadzilacos, V.1    Halpern, J.Y.2
  • 19
    • 51649126675 scopus 로고    scopus 로고
    • Lower bound for scalable Byzantine Agreement
    • D. Holtby, B.M. Kapron, and V. King, Lower bound for scalable Byzantine Agreement, Distributed Computing, 21 (2008) 239-248.
    • (2008) Distributed Computing , vol.21 , pp. 239-248
    • Holtby, D.1    Kapron, B.M.2    King, V.3
  • 24
    • 84976810569 scopus 로고
    • Reaching agreement in the presence of faults
    • M. Pease, R. Shostak, and L. Lamport, Reaching agreement in the presence of faults, Journal of the ACM, 27 (1980) 228-234.
    • (1980) Journal of the ACM , vol.27 , pp. 228-234
    • Pease, M.1    Shostak, R.2    Lamport, L.3
  • 25
    • 0023580443 scopus 로고
    • Sorting and selecting in rounds
    • N. Pippenger, Sorting and selecting in rounds, SIAM Journal on Computing, 16 (1987) 1032-1038.
    • (1987) SIAM Journal on Computing , vol.16 , pp. 1032-1038
    • Pippenger, N.1
  • 26
    • 0002956996 scopus 로고    scopus 로고
    • Bounds for dispersers, extractors, and depth-two superconcentrators
    • J. Radhakrishnan, and A. Ta-Shma, Bounds for dispersers, extractors, and depth-two superconcentrators, SIAM Journal of Discrete Mathematics, 13 (2000) 2-24.
    • (2000) SIAM Journal of Discrete Mathematics , vol.13 , pp. 2-24
    • Radhakrishnan, J.1    Ta-Shma, A.2
  • 27
    • 34248175874 scopus 로고    scopus 로고
    • Lossless condensers, unbalanced expanders, and extractors
    • A. Ta-Shma, C. Umans, and D. Zuckerman, Lossless condensers, unbalanced expanders, and extractors, Combinatorica, 27 (2007) 213-240.
    • (2007) Combinatorica , vol.27 , pp. 213-240
    • Ta-Shma, A.1    Umans, C.2    Zuckerman, D.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.