메뉴 건너뛰기




Volumn 51, Issue 8, 2008, Pages 91-100

Composable memory transactions

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; STORAGE ALLOCATION (COMPUTER);

EID: 49249091879     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1378704.1378725     Document Type: Article
Times cited : (43)

References (25)
  • 15
    • 33846666138 scopus 로고    scopus 로고
    • Subtleties of transactional memory atomicity semantics
    • Martin, M., Blundell, C., and Lewis, E. Subtleties of transactional memory atomicity semantics. IEEE Comput. Archit. Lett. 5( 2):17, 2006.
    • (2006) IEEE Comput. Archit. Lett , vol.5 , Issue.2 , pp. 17
    • Martin, M.1    Blundell, C.2    Lewis, E.3
  • 17
    • 0004062181 scopus 로고
    • Nested transactions: An approach to reliable distributed computing
    • Tech. Rep. MIT/LCS/TR-260, Massachusetts Institute of Technology, Apr
    • Moss, E.B. Nested transactions: An approach to reliable distributed computing. Tech. Rep. MIT/LCS/TR-260, Massachusetts Institute of Technology, Apr. 1981.
    • (1981)
    • Moss, E.B.1
  • 19
    • 49249136642 scopus 로고    scopus 로고
    • Beautiful concurrency
    • A. Oran and G. Wilson, Eds, O'Reilly
    • Peyton Jones, S. Beautiful concurrency. In Beautiful Code (2007), A. Oran and G. Wilson, Eds., O'Reilly.
    • (2007) Beautiful Code
    • Peyton Jones, S.1
  • 25
    • 34548083281 scopus 로고    scopus 로고
    • The free lunch is over: A fundamental turn toward concurrency in software
    • March
    • Sutter, H. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's J. (March 2005).
    • (2005) Dr. Dobb's J
    • Sutter, H.1


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