메뉴 건너뛰기




Volumn 65, Issue 4, 2005, Pages 492-505

Mutual exclusion in asynchronous systems with failure detectors

Author keywords

Asynchronous system; Failure detectors; Fault tolerance; Group mutual exclusion; Mutual exclusion

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DETECTORS; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; PROGRAM PROCESSORS;

EID: 14944386045     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.11.008     Document Type: Article
Times cited : (41)

References (20)
  • 1
    • 84976715309 scopus 로고
    • An efficient and fault-tolerant solution for distributed mutual exclusion
    • D. Agrawal, and A.E. Abbadi An efficient and fault-tolerant solution for distributed mutual exclusion ACM Trans. Comput. Systems 9 1 1991 1 20
    • (1991) ACM Trans. Comput. Systems , vol.9 , Issue.1 , pp. 1-20
    • Agrawal, D.1    Abbadi, A.E.2
  • 2
    • 0030197368 scopus 로고    scopus 로고
    • The weakest failure detector for solving consensus
    • T.D. Chandra, V. Hadzilacos, and 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
  • 3
    • 0030102105 scopus 로고    scopus 로고
    • Unreliable failure detectors for reliable distributed systems
    • T.D. Chandra, and 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
  • 5
    • 84945709358 scopus 로고
    • Solution of a problem in concurrent programming control
    • E.W. Dijkstra Solution of a problem in concurrent programming control Comm. ACM 8 9 1965 569
    • (1965) Comm. ACM , vol.8 , Issue.9 , pp. 569
    • Dijkstra, E.W.1
  • 6
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty process
    • M.J. Fischer, N.A. Lynch, and M.S. Paterson Impossibility of distributed consensus with one faulty process J. ACM 32 3 1985 374 382
    • (1985) J. ACM , vol.32 , Issue.3 , pp. 374-382
    • Fischer, M.J.1    Lynch, N.A.2    Paterson, M.S.3
  • 7
    • 0036302004 scopus 로고    scopus 로고
    • Analysis of timing-based mutual exclusion with random times
    • E. Gafni, and M. Mitzenmacher Analysis of timing-based mutual exclusion with random times SIAM J. Comput. 31 3 2001 816 837
    • (2001) SIAM J. Comput. , vol.31 , Issue.3 , pp. 816-837
    • Gafni, E.1    Mitzenmacher, M.2
  • 9
    • 0003806377 scopus 로고
    • A modular approach to fault-tolerant broadcast and related problems
    • Cornell University, Computer Science, May
    • V. Hadzilacos, S. Toueg, A modular approach to fault-tolerant broadcast and related problems, Technical Report, Cornell University, Computer Science, May 1994.
    • (1994) Technical Report
    • Hadzilacos, V.1    Toueg, S.2
  • 11
    • 0035392107 scopus 로고    scopus 로고
    • A simple local-spin group mutual exclusion algorithm
    • P. Keane, and M. Moir A simple local-spin group mutual exclusion algorithm IEEE Trans. Parallel Distrib. Systems 12 7 2001 673 685
    • (2001) IEEE Trans. Parallel Distrib. Systems , vol.12 , Issue.7 , pp. 673-685
    • Keane, P.1    Moir, M.2
  • 12
    • 0016090932 scopus 로고
    • A new solution of Dijkstra's concurrent programming problem
    • L. Lamport A new solution of Dijkstra's concurrent programming problem Comm. ACM 17 8 1974 453 455
    • (1974) Comm. ACM , vol.17 , Issue.8 , pp. 453-455
    • Lamport, L.1
  • 13
    • 0022699092 scopus 로고
    • The mutual exclusion problem, Parts I&II
    • L. Lamport The mutual exclusion problem, Parts I&II J. ACM 33 2 1986 313 348
    • (1986) J. ACM , vol.33 , Issue.2 , pp. 313-348
    • Lamport, L.1
  • 15
    • 0004215089 scopus 로고    scopus 로고
    • Morgan Kaufmann Publishers LosAltos, CA
    • N.A. Lynch Distributed Algorithms 1996 Morgan Kaufmann Publishers LosAltos, CA
    • (1996) Distributed Algorithms
    • Lynch, N.A.1
  • 16
    • 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. Systems 3 2 1985 145 159
    • (1985) ACM Trans. Comput. Systems , vol.3 , Issue.2 , pp. 145-159
    • Maekawa, M.1
  • 19
    • 0002974835 scopus 로고
    • A taxonomy of distributed mutual exclusion
    • M. Singhal A taxonomy of distributed mutual exclusion J. Parallel Distrib. Comput. 18 1 1993 94 101
    • (1993) J. Parallel Distrib. Comput. , vol.18 , Issue.1 , pp. 94-101
    • Singhal, M.1
  • 20
    • 0037473755 scopus 로고    scopus 로고
    • A simple group mutual l-exclusion algorithm
    • K. Vidyasankar A simple group mutual l -exclusion algorithm Inform. Process. Lett. 85 2003 79 85
    • (2003) Inform. Process. Lett. , vol.85 , pp. 79-85
    • Vidyasankar, K.1


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