메뉴 건너뛰기




Volumn , Issue , 2009, Pages 261-274

A runtime system for software lock elision

Author keywords

Algorithms; Design; Performance

Indexed keywords

ATOMIC BLOCKS; CONCURRENT THREADS; CRITICAL SECTIONS; GARBAGE COLLECTION; IF THERE ARE; MULTI-CORE PROCESSOR; PARALLEL PROGRAM; PERFORMANCE; RUNTIME SYSTEMS; SOFTWARE RUNTIME; SYSTEMS CODE; TYPE-SAFE LANGUAGES;

EID: 70349144374     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1519065.1519094     Document Type: Conference Paper
Times cited : (30)

References (31)
  • 3
    • 70349153931 scopus 로고
    • Cilk: An efficient multithreaded runtime system
    • Technical Report MIT-LCS-TM-548
    • Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: An efficient multithreaded runtime system. Technical Report MIT-LCS-TM-548, 1995.
    • (1995)
    • Blumofe, R.D.1    Joerg, C.F.2    Kuszmaul, B.C.3    Leiserson, C.E.4    Randall, K.H.5    Zhou, Y.6
  • 7
    • 6344219523 scopus 로고    scopus 로고
    • PhD thesis, Cambridge University Computer Laboratory, Also available as Technical Report UCAM-CL-TR-579
    • Keir Fraser. Practical lock freedom. PhD thesis, Cambridge University Computer Laboratory, 2003. Also available as Technical Report UCAM-CL-TR-579.
    • (2003) Practical lock freedom
    • Fraser, K.1
  • 12
    • 0019054806 scopus 로고
    • Concurrent manipulation of binary search trees
    • H. T. Kung and Philip L. Lehman. Concurrent manipulation of binary search trees. ACM Trans. Database Syst., 5 (3):354-382, 1980.
    • (1980) ACM Trans. Database Syst , vol.5 , Issue.3 , pp. 354-382
    • Kung, H.T.1    Lehman, P.L.2
  • 15
    • 38049022459 scopus 로고    scopus 로고
    • Lowering the overhead of software transactional memory, Computer Science Department, University of Rochester, March
    • Virendra J. Marathe, Michael F. Spear, Christopher Heriot, Athul Acharya, David Eisenstat, William N. Scherer, III, and Michael L. Scott. Lowering the overhead of software transactional memory. Technical Report TR 893, Computer Science Department, University of Rochester, March 2006.
    • (2006) Technical Report TR , vol.893
    • Marathe, V.J.1    Spear, M.F.2    Heriot, C.3    Acharya, A.4    Eisenstat, D.5    Scherer III, W.N.6    Scott, M.L.7
  • 17
    • 70349137732 scopus 로고    scopus 로고
    • Towards a lock-based semantics for Java STM. Technical Report UW-CSE-07-11-01, University of Washington, Nov
    • Vijay Menon, Steven Balensiefer, Tatiana Shpeis-man, Ali-Reza Adl-Tabatabai, Richard L. Hudson, Bratin Saha, and Adam Welc. Towards a lock-based semantics for Java STM. Technical Report UW-CSE-07-11-01, University of Washington, Nov 2007.
    • (2007)
    • Menon, V.1    Balensiefer, S.2    Shpeis-man, T.3    Adl-Tabatabai, A.-R.4    Hudson, R.L.5    Saha, B.6    Welc, A.7
  • 18
    • 3042671335 scopus 로고    scopus 로고
    • Hazard pointers: Safe memory reclamation for lock-free objects
    • Maged M. Michael. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst., 15(6):491-504, 2004.
    • (2004) IEEE Trans. Parallel Distrib. Syst , vol.15 , Issue.6 , pp. 491-504
    • Michael, M.M.1
  • 26
    • 35448967002 scopus 로고    scopus 로고
    • Privatization techniques for software transactional memory, Computer Science Department, University of Rochester, February
    • Michael F. Spear, Virendra J. Marathe, Luke Da-lessandro, and Michael L. Scott. Privatization techniques for software transactional memory. Technical Report TR 915, Computer Science Department, University of Rochester, February 2007.
    • (2007) Technical Report TR , vol.915
    • Spear, M.F.1    Marathe, V.J.2    Da-lessandro, L.3    Scott, M.L.4


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