메뉴 건너뛰기




Volumn 18, Issue 10, 2007, Pages 1345-1360

A quorum-based group mutual exclusion algorithm for a distributed system with dynamic group set

Author keywords

Group mutual exclusion; Message passing system; Mutual exclusion; Quorum based algorithm; Resource management

Indexed keywords

MESSAGE PASSING; QUEUEING NETWORKS; RESOURCE ALLOCATION; SYNCHRONIZATION;

EID: 34648825740     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2007.1072     Document Type: Article
Times cited : (32)

References (24)
  • 2
    • 84945709358 scopus 로고
    • Solution of a Problem in Concurrent Programming Control
    • E.W. Dijkstra, "Solution of a Problem in Concurrent Programming Control," Comm. ACM, vol. 8, no. 9, p. 569, 1965.
    • (1965) Comm. ACM , vol.8 , Issue.9 , pp. 569
    • Dijkstra, E.W.1
  • 3
    • 0017996760 scopus 로고
    • Time, Clocks, and the Ordering of Events in a Distributed System
    • July
    • L. Lamport, "Time, Clocks, and the Ordering of Events in a Distributed System," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
    • (1978) Comm. ACM , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 4
    • 0019439018 scopus 로고
    • An Optimal Algorithm for Mutual Exclusion in Computer Networks
    • Jan
    • G. Ricart and A.K. Agrawala, "An Optimal Algorithm for Mutual Exclusion in Computer Networks," Comm. ACM, vol. 24, no. 1, pp. 9-17, Jan. 1981.
    • (1981) Comm. ACM , vol.24 , Issue.1 , pp. 9-17
    • Ricart, G.1    Agrawala, A.K.2
  • 5
    • 0022151877 scopus 로고
    • A Distributed Mutual Exclusion Algorithm
    • I. Suzuki and T. Kasami, "A Distributed Mutual Exclusion Algorithm," ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344-349, 1985.
    • (1985) ACM Trans. Computer Systems , vol.3 , Issue.4 , pp. 344-349
    • Suzuki, I.1    Kasami, T.2
  • 6
    • 0024607971 scopus 로고
    • A Tree Based Algorithm for Distributed Mutual Exclusion
    • K. Raymond, "A Tree Based Algorithm for Distributed Mutual Exclusion," ACM Trans. Computer Systems, vol. 7, no. 1, pp. 61-77, 1989.
    • (1989) ACM Trans. Computer Systems , vol.7 , Issue.1 , pp. 61-77
    • Raymond, K.1
  • 8
    • 0015195766 scopus 로고
    • Hierarchical Ordering of Sequential Processes
    • Oct
    • E.W. Dijkstra, "Hierarchical Ordering of Sequential Processes," Acta Informatica, vol. 1, no. 2, pp. 115-138, Oct. 1971.
    • (1971) Acta Informatica , vol.1 , Issue.2 , pp. 115-138
    • Dijkstra, E.W.1
  • 11
    • 0034315904 scopus 로고    scopus 로고
    • Asynchronous Group Mutual Exclusion
    • Y.-J. Joung, "Asynchronous Group Mutual Exclusion," Distributed Computing, vol. 13, no. 4, pp. 189-206, 2000.
    • (2000) Distributed Computing , vol.13 , Issue.4 , pp. 189-206
    • Joung, Y.-J.1
  • 12
    • 0038043488 scopus 로고    scopus 로고
    • Quorum-Based Algorithms for Group Mutual Exclusion
    • May
    • Y.-J. Joung, "Quorum-Based Algorithms for Group Mutual Exclusion," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 5, pp. 463-475, May 2003.
    • (2003) IEEE Trans. Parallel and Distributed Systems , vol.14 , Issue.5 , pp. 463-475
    • Joung, Y.-J.1
  • 17
    • 0037473755 scopus 로고    scopus 로고
    • A Simple Group Mutual L-Exclusion Algorithm
    • K. Vidyasankar, "A Simple Group Mutual L-Exclusion Algorithm," Information Processing Letters, vol. 85, no. 2, pp. 79-85, 2003.
    • (2003) Information Processing Letters , vol.85 , Issue.2 , pp. 79-85
    • Vidyasankar, K.1
  • 18
    • 0033893113 scopus 로고    scopus 로고
    • Asynchronous Group Mutual Exclusion in Ring Networks
    • K.-P. Wu and Y.-J. Joung, "Asynchronous Group Mutual Exclusion in Ring Networks," IEE Proc. Computers and Digital Techniques, vol. 147, no. 1, pp. 1-8, 2000.
    • (2000) IEE Proc. Computers and Digital Techniques , vol.147 , Issue.1 , pp. 1-8
    • Wu, K.-P.1    Joung, Y.-J.2
  • 19
    • 15744369039 scopus 로고    scopus 로고
    • Group Mutual Exclusion in Token Rings
    • S. Cantarell, A.K. Datta, F. Petit, and V. Villain, "Group Mutual Exclusion in Token Rings," Computer J., vol. 48, no. 2, pp. 239-252, 2005.
    • (2005) Computer J , vol.48 , Issue.2 , pp. 239-252
    • Cantarell, S.1    Datta, A.K.2    Petit, F.3    Villain, V.4
  • 21
    • 0036649643 scopus 로고    scopus 로고
    • The Congenial Talking Philosophers Problem in Computer Networks
    • Y.-J. Joung, "The Congenial Talking Philosophers Problem in Computer Networks," Distributed Computing, pp. 155-175, 2002.
    • (2002) Distributed Computing , pp. 155-175
    • Joung, Y.-J.1
  • 22
    • 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
  • 24
    • 0024606602 scopus 로고
    • Global Quiescence Detection Based on Credit Distribution and Recovery
    • F. Mattern, "Global Quiescence Detection Based on Credit Distribution and Recovery," Information Processing Letters, vol. 30, no. 4, pp. 195-200, 1989.
    • (1989) Information Processing Letters , vol.30 , Issue.4 , pp. 195-200
    • Mattern, F.1


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