메뉴 건너뛰기




Volumn , Issue , 2002, Pages 130-

Brief announcement: A highly concurrent group mutual l-exclusion algorithm

Author keywords

[No Author keywords available]

Indexed keywords

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

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

References (3)
  • 1
    • 0031636411 scopus 로고    scopus 로고
    • Asynchronous group mutual exclusion
    • Yuh-Jzer Joung, Asynchronous group mutual exclusion, PODC-98, 51-60.
    • PODC-98 , pp. 51-60
    • Joung, Y.-J.1
  • 2
    • 0032638415 scopus 로고    scopus 로고
    • A simple local-spin group mutual exclusion algorithm
    • P. Keane and M. Moir, A simple local-spin group mutual exclusion algorithm, PODC-99, 23-32.
    • PODC-99 , pp. 23-32
    • Keane, P.1    Moir, M.2
  • 3
    • 0012528667 scopus 로고    scopus 로고
    • A simple group mutual l-exclusion algorithm
    • Submitted for publication
    • K. Vidyasankar, A simple group mutual l-exclusion algorithm, Submitted for publication.
    • Vidyasankar, K.1


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