메뉴 건너뛰기




Volumn 8, Issue 4, 1997, Pages 402-411

A geometric approach for constructing coteries and k-coteries

Author keywords

Coterie; Critical section; Distributed algorithm; Fault tolerance; Mutual exclusion; Quorum set

Indexed keywords

ALGORITHMS; GRAPH THEORY;

EID: 0031124573     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.588618     Document Type: Article
Times cited : (47)

References (12)
  • 1
    • 84976715309 scopus 로고
    • An Efficient and Fault-Tolerant Algorithm for Distributed Mutual Exclusion
    • Feb.
    • D. Agrawal and A. El Abbadi, "An Efficient and Fault-Tolerant Algorithm for Distributed Mutual Exclusion," ACM Trans. Computer Systems, vol. 9, no. 1, pp. 1-20, Feb. 1991.
    • (1991) ACM Trans. Computer Systems , vol.9 , Issue.1 , pp. 1-20
    • Agrawal, D.1    El Abbadi, A.2
  • 2
    • 84930838320 scopus 로고
    • The Grid Protocol A High Performance Scheme for Maintain Replicated Data
    • Dec.
    • S.Y. Cheung, M.H. Ammar, and M. Ahamad, "The Grid Protocol A High Performance Scheme for Maintain Replicated Data," IEEE Trans. Knowledge and Data Eng., vol. 4, no. 6, pp. 582-592, Dec. 1992.
    • (1992) IEEE Trans. Knowledge and Data Eng. , vol.4 , Issue.6 , pp. 582-592
    • Cheung, S.Y.1    Ammar, M.H.2    Ahamad, M.3
  • 4
    • 0022145769 scopus 로고
    • How to Assign Votes in a Distributed Systems
    • Oct.
    • H. Garcia-Molina and D. Barbara, "How to Assign Votes in a Distributed Systems," J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
    • (1985) J. ACM , vol.32 , Issue.4 , pp. 841-860
    • Garcia-Molina, H.1    Barbara, D.2
  • 8
    • 84941862740 scopus 로고
    • Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
    • Sept.
    • A. Kumar, "Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data," IEEE Trans. Computers, vol. 40, no. 9, pp. 996-1,004, Sept. 1991.
    • (1991) IEEE Trans. Computers , vol.40 , Issue.9
    • Kumar, A.1
  • 9
    • 0022069122 scopus 로고
    • A √N Algorithm for Mutual Exclusion in Decentralized Systems
    • May
    • M. Maekawa, "A √N Algorithm for Mutual Exclusion in Decentralized Systems," ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.
    • (1985) ACM Trans. Computer Systems , vol.3 , Issue.2 , pp. 145-159
    • Maekawa, M.1
  • 10
    • 0024608694 scopus 로고
    • A Distributed Algorithm for Multiple Entries to a Critical Section
    • Feb.
    • K. Raymond, "A Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 30, no. 4, pp. 189-193, Feb. 1989.
    • (1989) Information Processing Letters , vol.30 , Issue.4 , pp. 189-193
    • Raymond, K.1
  • 11
    • 0026762219 scopus 로고
    • Another Distributed Algorithm for Multiple Entries to a Critical Section
    • Jan.
    • P.K. Srimani and R.L.N. Reddy, "Another Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 41, no. 1, pp. 51-57, Jan. 1992.
    • (1992) Information Processing Letters , vol.41 , Issue.1 , pp. 51-57
    • Srimani, P.K.1    Reddy, R.L.N.2
  • 12
    • 0018480001 scopus 로고
    • A Majority Consensus Approach to Concurrency Control
    • June
    • R.H. Thomas, "A Majority Consensus Approach to Concurrency Control," ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.
    • (1979) ACM Trans. Database Systems , vol.4 , Issue.2 , pp. 180-209
    • Thomas, R.H.1


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