메뉴 건너뛰기




Volumn , Issue , 2005, Pages 251-260

A dynamic group Mutual exclusion algorithm using surrogate-quorums

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION ANALYSIS; PROBLEM ORIENTED LANGUAGES; SYNCHRONIZATION; COMPUTER SIMULATION; LARGE SCALE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

EID: 27944445497     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (10)

References (21)
  • 1
    • 0003847683 scopus 로고    scopus 로고
    • Elegant solutions for group mutual exclusion problem
    • Department of Computer Science, Memorial University of New-foundland, St.John's, Newfoundland, Canada
    • K. Alagarsamy and K. Vidyasankar. Elegant Solutions for Group Mutual Exclusion Problem. Technical report, Department of Computer Science, Memorial University of New-foundland, St.John's, Newfoundland, Canada, 1999.
    • (1999) Technical Report
    • Alagarsamy, K.1    Vidyasankar, K.2
  • 7
    • 84945709358 scopus 로고
    • Solution of a problem in concurrent programming control
    • E. W. Dijkstra. Solution of a Problem in Concurrent Programming Control. Communications of the ACM (CACM), 8(9):569, 1965.
    • (1965) Communications of the ACM (CACM) , vol.8 , Issue.9 , pp. 569
    • Dijkstra, E.W.1
  • 8
    • 0015195766 scopus 로고
    • Hierarchical ordering of sequential processes
    • Oct.
    • E. W. Dijkstra. Hierarchical Ordering of Sequential Processes. Acta Informatica, 1(2):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 (DC), 13(4): 189-206, 2000.
    • (2000) Distributed Computing (DC) , vol.13 , Issue.4 , pp. 189-206
    • Joung, Y.-J.1
  • 12
    • 0036649643 scopus 로고    scopus 로고
    • The congenial talking philosophera problem in computer networks
    • Y.-J. Joung. The Congenial Talking Philosophera Problem in Computer Networks. Distributed Computing (DC), pages 155-175, 2002.
    • (2002) Distributed Computing (DC) , pp. 155-175
    • Joung, Y.-J.1
  • 15
    • 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. Communications of the ACM (CACM), 21(7):558-565, July 1978.
    • (1978) Communications of the ACM (CACM) , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 16
    • 0022069122 scopus 로고
    • Algorithm for mutual exclusion in decentralized system
    • May
    • M. Maekawa. Algorithm for Mutual Exclusion in Decentralized System. ACM Transactions on Computer Systems, 3(2): 145-159, May 1985.
    • (1985) ACM Transactions on Computer Systems , vol.3 , Issue.2 , pp. 145-159
    • Maekawa, M.1
  • 17
    • 0024606602 scopus 로고
    • Global quiescence detection based on credit distribution and recovery
    • F. Mattem. Global Quiescence Detection based on Credit Distribution and Recovery. Information Processing Letters (IPL), 30(4): 195-200, 1989.
    • (1989) Information Processing Letters (IPL) , vol.30 , Issue.4 , pp. 195-200
    • Mattem, F.1
  • 18
    • 0024607971 scopus 로고
    • A tree based algorithm for distributed mutual exclusion
    • K. Raymond. A Tree based Algorithm for Distributed Mutual Exclusion. ACM Transactions on Computer Systems, 7(1):61-77, 1989.
    • (1989) ACM Transactions on Computer Systems , vol.7 , Issue.1 , pp. 61-77
    • Raymond, K.1
  • 19
    • 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. Communications of the ACM (CACM), 24(1):9-17, Jan. 1981.
    • (1981) Communications of the ACM (CACM) , vol.24 , Issue.1 , pp. 9-17
    • Ricart, G.1    Agrawala, A.K.2


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