메뉴 건너뛰기




Volumn 21, Issue 3, 2008, Pages 201-222

On the computability power and the robustness of set agreement-oriented failure detector classes

Author keywords

Asynchronous system; Distributed algorithm; Fault tolerance; Set agreement; Unreliable failure detector

Indexed keywords

CONNECTORS (STRUCTURAL); DISTRIBUTED COMPUTER SYSTEMS; LAWS AND LEGISLATION;

EID: 49149095043     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-008-0064-2     Document Type: Article
Times cited : (15)

References (29)
  • 3
    • 0030197368 scopus 로고    scopus 로고
    • The weakest failure detector for solving consensus
    • 4
    • Chandra T., Hadzilacos V., Toueg S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685-722 (1996)
    • (1996) J. ACM , vol.43 , pp. 685-722
    • Chandra, T.1    Hadzilacos, V.2    Toueg, S.3
  • 4
    • 0030102105 scopus 로고    scopus 로고
    • Unreliable failure detectors for reliable distributed systems
    • 2
    • Chandra T.D., Toueg S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225-267 (1996)
    • (1996) J. ACM , vol.43 , pp. 225-267
    • Chandra, T.D.1    Toueg, S.2
  • 5
    • 0001197842 scopus 로고
    • More choices allow more faults: Set consensus problems in totally asynchronous systems
    • Chaudhuri S.: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105, 132-158 (1993)
    • (1993) Inf. Comput. , vol.105 , pp. 132-158
    • Chaudhuri, S.1
  • 6
    • 0032154578 scopus 로고    scopus 로고
    • Reducing Ω to W
    • 6
    • Chu F.: Reducing Ω to W. Inf. Process. Lett. 76(6), 293-298 (1998)
    • (1998) Inf. Process. Lett. , vol.76 , pp. 293-298
    • Chu, F.1
  • 9
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty process
    • 2
    • Fischer M.J., Lynch N., Paterson M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374-382 (1985)
    • (1985) J. ACM , vol.32 , pp. 374-382
    • Fischer, M.J.1    Lynch, N.2    Paterson, M.S.3
  • 10
    • 1942468125 scopus 로고    scopus 로고
    • The information structure of indulgent consensus
    • 4
    • Guerraoui R., Raynal M.: The information structure of indulgent consensus. IEEE Trans. Comput. 53(4), 453-466 (2004)
    • (2004) IEEE Trans. Comput. , vol.53 , pp. 453-466
    • Guerraoui, R.1    Raynal, M.2
  • 13
    • 27844444073 scopus 로고    scopus 로고
    • Tight bounds for k-set agreement with limited scope accuracy failure detectors
    • 2
    • Herlihy M.P., Penso L.D.: Tight bounds for k-set agreement with limited scope accuracy failure detectors. Distrib. Comput. 18(2), 157-166 (2005)
    • (2005) Distrib. Comput. , vol.18 , pp. 157-166
    • Herlihy, M.P.1    Penso, L.D.2
  • 15
    • 0001059575 scopus 로고    scopus 로고
    • The topological structure of asynchronous computability
    • 6
    • Herlihy M.P., Shavit N.: The topological structure of asynchronous computability. J. ACM 46(6), 858-923 (1999)
    • (1999) J. ACM , vol.46 , pp. 858-923
    • Herlihy, M.P.1    Shavit, N.2
  • 16
    • 0032058184 scopus 로고    scopus 로고
    • The part-time parliament
    • 2
    • Lamport L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133-169 (1998)
    • (1998) ACM Trans. Comput. Syst. , vol.16 , pp. 133-169
    • Lamport, L.1
  • 17
    • 4243070797 scopus 로고    scopus 로고
    • Conditions on input vectors for consensus solvability in asynchronous distributed systems
    • 6
    • Mostefaoui A., Rajsbaum S., Raynal M.: Conditions on input vectors for consensus solvability in asynchronous distributed systems. J. ACM 50(6), 922-954 (2003)
    • (2003) J. ACM , vol.50 , pp. 922-954
    • Mostefaoui, A.1    Rajsbaum, S.2    Raynal, M.3
  • 19
    • 37849188430 scopus 로고    scopus 로고
    • From W to Ω: aa simple bounded quiescent reliable broadcast-based transformation
    • 1
    • Mostefaoui A., Rajsbaum S., Raynal M., Travers C.: From W to Ω: a simple bounded quiescent reliable broadcast-based transformation. J. Parallel Distrib. Comput. 67(1), 125-129 (2007)
    • (2007) J. Parallel Distrib. Comput. , vol.67 , pp. 125-129
    • Mostefaoui, A.1    Rajsbaum, S.2    Raynal, M.3    Travers, C.4
  • 26
    • 33748697492 scopus 로고    scopus 로고
    • A short introduction to failure detectors for asynchronous distributed systems
    • 1
    • Raynal M.: A short introduction to failure detectors for asynchronous distributed systems. ACM SIGACT News Distrib. Comput. Column 36(1), 53-70 (2005)
    • (2005) ACM SIGACT News Distrib. Comput. Column , vol.36 , pp. 53-70
    • Raynal, M.1
  • 27
    • 0034541366 scopus 로고    scopus 로고
    • Wait-free k-set agreement is impossible: The topology of public knowledge
    • 5
    • Saks M., Zaharoglou F.: Wait-free k-set agreement is impossible: the topology of public knowledge. SIAM J. Comput. 29(5), 1449-1483 (2000)
    • (2000) SIAM J. Comput. , vol.29 , pp. 1449-1483
    • Saks, M.1    Zaharoglou, F.2
  • 28
    • 0031123554 scopus 로고    scopus 로고
    • Early consensus in an asynchronous system with a weak failure detector
    • 3
    • Schiper A.: Early consensus in an asynchronous system with a weak failure detector. Distrib. Comput. 10(3), 149-157 (1997)
    • (1997) Distrib. Comput. , vol.10 , pp. 149-157
    • Schiper, A.1


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