메뉴 건너뛰기




Volumn 185, Issue 2, 1997, Pages 259-275

A fully distributed quorum consensus method with high fault-tolerance and low communication overhead

Author keywords

Concurrency control; Distributed computing; Fault tolerance; Quorum consensus method; Replicated data management

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONCURRENCY CONTROL; DATA PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0031246670     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00046-7     Document Type: Article
Times cited : (5)

References (13)
  • 1
    • 84976715309 scopus 로고
    • An efficient solution to the distributed mutual exclusion problem
    • D. Agrawal, A. El Abbadi, An efficient solution to the distributed mutual exclusion problem, ACM Trans. Comput. Syst. 9 (1) (1991) 1-20.
    • (1991) ACM Trans. Comput. Syst. , vol.9 , Issue.1 , pp. 1-20
    • Agrawal, D.1    El Abbadi, A.2
  • 3
    • 0028564620 scopus 로고
    • An efficient method for mutual exclusion in truly distributed systems
    • H. Chen, J. Tang, An efficient method for mutual exclusion in truly distributed systems, Int. Conf. on Distributed Computing Systems, 1994, pp. 97-104.
    • (1994) Int. Conf. on Distributed Computing Systems , pp. 97-104
    • Chen, H.1    Tang, J.2
  • 4
    • 84930838320 scopus 로고
    • The grid protocol: A high performance scheme for maintaining replicated data
    • S.Y. Cheung, M. Ammar, M. Ahamad, The grid protocol: a high performance scheme for maintaining replicated data, IEEE Trans. Knowledge and Data Eng. 4 (6) (1992) 582-592.
    • (1992) IEEE Trans. Knowledge and Data Eng. , vol.4 , Issue.6 , pp. 582-592
    • Cheung, S.Y.1    Ammar, M.2    Ahamad, M.3
  • 6
    • 0022145769 scopus 로고
    • How to assign votes in a distributed systems
    • H. Garcia-Molina, D. Barbara, How to assign votes in a distributed systems, J. ACM 32 (4) (1985) 841-860.
    • (1985) J. ACM , vol.32 , Issue.4 , pp. 841-860
    • Garcia-Molina, H.1    Barbara, D.2
  • 7
    • 84941862740 scopus 로고
    • Hierarchical quorum consensus: A new algorithm for managing replicated data
    • A. Kumar, Hierarchical quorum consensus: A new algorithm for managing replicated data, IEEE Trans. Comput. 40 (9) (1991) 996-1004.
    • (1991) IEEE Trans. Comput. , vol.40 , Issue.9 , pp. 996-1004
    • Kumar, A.1
  • 8
    • 0026390445 scopus 로고
    • A √n high availability hierarchical grid algorithm for replicated data
    • A. Kumar, S.Y. Cheung, A √n high availability hierarchical grid algorithm for replicated data, Inform. Process. Lett. 40 (1991) 311-316.
    • (1991) Inform. Process. Lett. , vol.40 , pp. 311-316
    • Kumar, A.1    Cheung, S.Y.2
  • 9
    • 0027560644 scopus 로고
    • Cost and availability tradeoffs in replicated data concurrency control
    • A. Kumar, A. Segev, Cost and availability tradeoffs in replicated data concurrency control, ACM Trans. Database Syst. 18 (1) (1993) 102-131.
    • (1993) ACM Trans. Database Syst. , vol.18 , Issue.1 , pp. 102-131
    • Kumar, A.1    Segev, A.2
  • 10
    • 0030601018 scopus 로고    scopus 로고
    • An optimal voting schema for minimizing the overall communication cost in replicated data management
    • X. Lin, M.E. Orlowska, An optimal voting schema for minimizing the overall communication cost in replicated data management, J. Parallel Distributed Comput. 35 (1996) 97-103.
    • (1996) J. Parallel Distributed Comput. , vol.35 , pp. 97-103
    • Lin, X.1    Orlowska, M.E.2
  • 11
    • 0022069122 scopus 로고
    • A √N algorithm for mutual exclusion in decentralized systems
    • M. Maekawa, A √N algorithm for mutual exclusion in decentralized systems, ACM Trans. Comput. Syst. 3 (2) (1985) 145-159.
    • (1985) ACM Trans. Comput. Syst. , vol.3 , Issue.2 , pp. 145-159
    • Maekawa, M.1


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