메뉴 건너뛰기




Volumn 2790, Issue , 2004, Pages 651-660

CAS-based lock-free algorithm for shared deques

Author keywords

[No Author keywords available]

Indexed keywords

LOCKS (FASTENERS);

EID: 35048837164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article
Times cited : (33)

References (19)
  • 3
    • 4243102868 scopus 로고    scopus 로고
    • Improved implementations of binary universal operations
    • September
    • Hagit Attiya and Eyal Dagan. Improved implementations of binary universal operations. Journal of the ACM, 48(5):1013-1037, September 2001.
    • (2001) Journal of the ACM , vol.48 , Issue.5 , pp. 1013-1037
    • Attiya, H.1    Dagan, E.2
  • 8
    • 0027695171 scopus 로고
    • A methodology for implementing highly concurrent objects
    • November
    • Maurice P. Herlihy. A methodology for implementing highly concurrent objects. ACM Transactions on Programming Languages and Systems, 15(5):745-770, November 1993.
    • (1993) ACM Transactions on Programming Languages and Systems , vol.15 , Issue.5 , pp. 745-770
    • Herlihy, M.P.1
  • 15
    • 0028436588 scopus 로고
    • A nonblocking algorithm for shared queues using compare-and-swap
    • May
    • Sundeep Prakash, Yann-Hang Lee, and Theodore Johnson. A nonblocking algorithm for shared queues using compare-and-swap. IEEE Transactions on Computers, 43(5):548-559, May 1994.
    • (1994) IEEE Transactions on Computers , vol.43 , Issue.5 , pp. 548-559
    • Prakash, S.1    Lee, Y.-H.2    Johnson, T.3
  • 17
    • 0031069218 scopus 로고    scopus 로고
    • Software transactional memory
    • Nir Shavit and Dan Touitou. Software transactional memory. Distributed Computing, 10(2):99-116, 1997.
    • (1997) Distributed Computing , vol.10 , Issue.2 , pp. 99-116
    • Shavit, N.1    Touitou, D.2


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