{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:23Z","timestamp":1750307303045,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,4]]},"DOI":"10.1145\/1989493.1989500","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"43-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["A study of transactional memory vs. locks in practice"],"prefix":"10.1145","author":[{"given":"Victor","family":"Pankratius","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Ali-Reza","family":"Adl-Tabatabai","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69501-1_21"},{"volume-title":"March","year":"2011","key":"e_1_3_2_1_2_1","unstructured":"\u2122 bibliography. http:\/\/www.cs.wisc.edu\/trans-memory\/biblio\/index.html , March 2011 . \u2122 bibliography. http:\/\/www.cs.wisc.edu\/trans-memory\/biblio\/index.html, March 2011."},{"key":"e_1_3_2_1_3_1","volume-title":"Draft specification of transactional language constructs for C++ (v.1.0)","author":"Adl-Tabatabai A.-R.","year":"2009","unstructured":"A.-R. Adl-Tabatabai and T. Shpeisman (editors). Draft specification of transactional language constructs for C++ (v.1.0) , 2009 . A.-R. Adl-Tabatabai and T. Shpeisman (editors). Draft specification of transactional language constructs for C++ (v.1.0), 2009."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133985"},{"key":"e_1_3_2_1_5_1","unstructured":"D. Bacon etal The \"double-checked locking is broken\" declaration. http:\/\/www.cs.umd.edu\/~pugh\/java\/memoryModel\/DoubleCheckedLocking.html Dec. 2010.  D. Bacon et al. The \"double-checked locking is broken\" declaration. http:\/\/www.cs.umd.edu\/~pugh\/java\/memoryModel\/DoubleCheckedLocking.html Dec. 2010."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1299042.1299064"},{"key":"e_1_3_2_1_7_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R.","year":"1999","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto . Modern Information Retrieval . Addison-Wesley , May 1999 . R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, May 1999."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454128"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400214.1400228"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168900"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272998.1273029"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506312"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_15_1","volume-title":"language extensions and user's guide","author":"STM","year":"2008","unstructured":"Intel. Intel C++ STM compiler prototype edition 2.0. language extensions and user's guide , 2008 . Intel. Intel C++STM compiler prototype edition 2.0. language extensions and user's guide, 2008."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294271"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123003"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386118.1386125"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. IISWC","author":"Minh C. C.","year":"2008","unstructured":"C. C. Minh : Stanford transactional applications for multi-processing . In Proc. IISWC , 2008 . C. C. Minh et al. STAMP: Stanford transactional applications for multi-processing. In Proc. IISWC, 2008."},{"key":"e_1_3_2_1_20_1","first-page":"254","volume-title":"Proc. HPCA'06","author":"Moore K.","year":"2006","unstructured":"K. Moore : log-based transactional memory . In Proc. HPCA'06 , pages 254 -- 265 , 2006 . K. Moore et al. LogTM: log-based transactional memory. In Proc. HPCA'06, pages 254--265, 2006."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449780"},{"key":"e_1_3_2_1_22_1","volume-title":"Does transactional memory keep its promises? Results from an empirical study. Technical report","author":"Pankratius V.","year":"2009","unstructured":"V. Pankratius Does transactional memory keep its promises? Results from an empirical study. Technical report , 2009 -12, University of Karlsruhe , Germany , 2009. V. Pankratius et al. Does transactional memory keep its promises? Results from an empirical study. Technical report, 2009-12, University of Karlsruhe, Germany, 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086378"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693462"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-008-9102-8"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123001"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2007.4362186"},{"key":"e_1_3_2_1_28_1","volume-title":"V10(2):99--116","author":"Shavit N.","year":"1997","unstructured":"N. Shavit and D. Touitou . Software transactional memory. Distributed Computing , V10(2):99--116 , 1997 . N. Shavit and D. Touitou. Software transactional memory. Distributed Computing, V10(2):99--116, 1997."},{"key":"e_1_3_2_1_29_1","volume-title":"SPEC OpenMP Benchmark Suite. www.spec.org\/omp","author":"Standard Performance Evaluation Corporation","year":"2009","unstructured":"Standard Performance Evaluation Corporation . SPEC OpenMP Benchmark Suite. www.spec.org\/omp , 2009 . Standard Performance Evaluation Corporation. SPEC OpenMP Benchmark Suite. www.spec.org\/omp, 2009."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1299042.1299062"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/223982.223990"},{"key":"e_1_3_2_1_32_1","volume-title":"Design and Methods","author":"Yin R. K.","year":"2002","unstructured":"R. K. Yin . Case Study Research : Design and Methods . Sage Publications, Inc , 3rd edition, 2002 . R. K. Yin. Case Study Research: Design and Methods. Sage Publications, Inc, 3rd edition, 2002."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134285.1134333"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504183"}],"event":{"name":"SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"San Jose California USA","acronym":"SPAA '11"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989500","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989493.1989500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:56Z","timestamp":1750244396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":34,"alternative-id":["10.1145\/1989493.1989500","10.1145\/1989493"],"URL":"https:\/\/doi.org\/10.1145\/1989493.1989500","relation":{},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}