메뉴 건너뛰기




Volumn 4167 LNCS, Issue , 2006, Pages 299-313

Bounded wait-free f-resilient atomic byzantine data storage systems for an unbounded number of clients

Author keywords

Atomic; Byzantine; Fault tolerance; Replication; Timestamps; Wait free

Indexed keywords

DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; SEMANTICS; SERVERS;

EID: 33845203330     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864219_21     Document Type: Conference Paper
Times cited : (3)

References (11)
  • 3
    • 0029215351 scopus 로고
    • Sharing memory robustly in message-passing systems
    • H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. J. ACM, 42(1):124-142, 1995.
    • (1995) J. ACM , vol.42 , Issue.1 , pp. 124-142
    • Attiya, H.1    Bar-Noy, A.2    Dolev, D.3
  • 6
    • 0032058257 scopus 로고    scopus 로고
    • Fault-tolerant wait-free shared objects
    • P. Jayanti, T. D. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. J. ACM, 45(3):451-500, 1998.
    • (1998) J. ACM , vol.45 , Issue.3 , pp. 451-500
    • Jayanti, P.1    Chandra, T.D.2    Toueg, S.3
  • 7
    • 0030197411 scopus 로고    scopus 로고
    • How to share concurrent wait-free variables
    • M. Li, J. Tromp, and P. M. B. Vitányi. How to share concurrent wait-free variables. J. ACM, 43(4):723-746, 1996.
    • (1996) J. ACM , vol.43 , Issue.4 , pp. 723-746
    • Li, M.1    Tromp, J.2    Vitányi, P.M.B.3


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