메뉴 건너뛰기
Information Processing Letters
Volumn 67, Issue 6, 1998, Pages 289-293
Reducing Ω to ◇W
Author keywords

Distributed computing; Failure detector; Fault tolerance
Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; FAILURE ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; THEOREM PROVING;
EID: 0032154578     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00122-7     Document Type: Article
Times cited : (43)
References (3)
  • 1
    • 0030197368 scopus 로고    scopus 로고
    • The weakest failure detector for solving consensus
    • T.D. Chandra, V. Hadzilacos, S. Toueg, The weakest failure detector for solving consensus, J. ACM 43 (4) (1996) 685-722.
    • (1996) J. ACM , vol.43 , Issue.4 , pp. 685-722
    • Chandra, T.D.1    Hadzilacos, V.2    Toueg, S.3
  • 2
    • 0030102105 scopus 로고    scopus 로고
    • Unreliable failure detectors for reliable distributed systems
    • T.D. Chandra, S. Toueg, Unreliable failure detectors for reliable distributed systems, J. ACM 43 (2) (1996) 225-267.
    • (1996) J. ACM , vol.43 , Issue.2 , pp. 225-267
    • Chandra, T.D.1    Toueg, S.2
  • 3
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty process
    • M.J. Fischer, N.A. Lynch, M.S. Paterson, Impossibility of distributed consensus with one faulty process, J. ACM 32 (2) (1985) 374-382.
    • (1985) J. ACM , vol.32 , Issue.2 , pp. 374-382
    • Fischer, M.J.1    Lynch, N.A.2    Paterson, M.S.3

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