{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:50:20Z","timestamp":1759942220349,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T00:00:00Z","timestamp":1249948800000},"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":[[2009,8,11]]},"DOI":"10.1145\/1583991.1584049","type":"proceedings-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T18:34:59Z","timestamp":1250534099000},"page":"214-222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Optimizing transactions for captured memory"],"prefix":"10.1145","author":[{"given":"Aleksandar","family":"Dragojevic","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"Yang","family":"Ni","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, CA, USA"}]},{"given":"Ali-Reza","family":"Adl-Tabatabai","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133985"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/356989.357000"},{"key":"e_1_3_2_1_3_1","volume-title":"IISWC","author":"Minh Chi Cao","year":"2008","unstructured":"Chi Cao Minh , JaeWoong Chung , Christos Kozyrakis , and Kunle Olukotun . STAMP : Stanford transactional applications for multi-processing . In IISWC , 2008 . Chi Cao Minh, JaeWoong Chung, Christos Kozyrakis, and Kunle Olukotun. STAMP: Stanford transactional applications for multi-processing. In IISWC, 2008."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320386"},{"key":"e_1_3_2_1_5_1","volume-title":"TRANSACT","author":"Dalessandro Luke","year":"2007","unstructured":"Luke Dalessandro , Virendra J. Marathe , Michael F. Spear , and Michael L. Scott . Capabilities and limitations of library-based software transactional memory in C++ . In TRANSACT 2007 . Luke Dalessandro, Virendra J. Marathe, Michael F. Spear, and Michael L. Scott. Capabilities and limitations of library-based software transactional memory in C++. In TRANSACT 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782474.1782501"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133984"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133956.1133967"},{"key":"e_1_3_2_1_12_1","volume-title":"Art of Computer Programming, Volume 1: Fundamental Algorithms","author":"Knuth Donald E.","year":"1997","unstructured":"Donald E. Knuth . Art of Computer Programming, Volume 1: Fundamental Algorithms ( 3 rd Edition). Addison-Wesley Professional , July 1997 . Donald E. Knuth. Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd Edition). Addison-Wesley Professional, July 1997.","edition":"3"},{"key":"e_1_3_2_1_13_1","volume-title":"TRANSACT","author":"Lev Yosef","year":"2007","unstructured":"Yosef Lev , Mark Moir , and Dan Nussbaum . PhTM : Phased transactional memory . In TRANSACT 2007 . Yosef Lev, Mark Moir, and Dan Nussbaum. PhTM: Phased transactional memory. In TRANSACT 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449780"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378562"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123001"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250744"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378582"}],"event":{"name":"SPAA 09: 21st ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Calgary AB Canada","acronym":"SPAA 09"},"container-title":["Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1584049","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1583991.1584049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:55Z","timestamp":1750278175000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1584049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,11]]},"references-count":19,"alternative-id":["10.1145\/1583991.1584049","10.1145\/1583991"],"URL":"https:\/\/doi.org\/10.1145\/1583991.1584049","relation":{},"subject":[],"published":{"date-parts":[[2009,8,11]]},"assertion":[{"value":"2009-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}