{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:36Z","timestamp":1772164056285,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T00:00:00Z","timestamp":1422057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CSR-1218695, CAREER-1253703, CCF-1421612"],"award-info":[{"award-number":["CSR-1218695, CAREER-1253703, CCF-1421612"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,24]]},"DOI":"10.1145\/2688500.2688510","type":"proceedings-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T09:12:26Z","timestamp":1422436346000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Low-overhead software transactional memory with progress guarantees and strong semantics"],"prefix":"10.1145","author":[{"given":"Minjia","family":"Zhang","sequence":"first","affiliation":[{"name":"Ohio State University, USA"}]},{"given":"Jipeng","family":"Huang","sequence":"additional","affiliation":[{"name":"Ohio State University, USA"}]},{"given":"Man","family":"Cao","sequence":"additional","affiliation":[{"name":"Ohio State University, USA"}]},{"given":"Michael D.","family":"Bond","sequence":"additional","affiliation":[{"name":"Ohio State University, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,1,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328449"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504203"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1787234.1787255"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.442.0399"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.34"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509519"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480909"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628086"},{"key":"e_1_3_2_1_9_1","volume-title":"WoDet","author":"Cao M.","year":"2014","unstructured":"M. Cao , M. Zhang , and M. D. Bond . Drinking from Both Glasses: Adaptively Combining Pessimistic and Optimistic Synchronization for Efficient Parallel Runtime Support . In WoDet , 2014 . M. Cao, M. Zhang, and M. D. Bond. Drinking from Both Glasses: Adaptively Combining Pessimistic and Optimistic Synchronization for Efficient Parallel Runtime Support. In WoDet, 2014."},{"key":"e_1_3_2_1_10_1","author":"Minh C. Cao","year":"2008","unstructured":"C. Cao Minh , J. Chung , C. Kozyrakis , and K. Olukotun . STAMP: Stanford Transactional Applications for Multi-Processing. In IISWC , 2008 . C. Cao Minh, J. Chung, C. Kozyrakis, and K. Olukotun. STAMP: Stanford Transactional Applications for Multi-Processing. In IISWC, 2008.","journal-title":"STAMP: Stanford Transactional Applications for Multi-Processing. In IISWC"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400214.1400228"},{"key":"e_1_3_2_1_12_1","volume-title":"TRANSACT","author":"Dalessandro L.","year":"2009","unstructured":"L. Dalessandro and M. L. Scott . Strong Isolation is a Weak Idea . In TRANSACT , 2009 . L. Dalessandro and M. L. Scott. Strong Isolation is a Weak Idea. In TRANSACT, 2009."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370843"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888781.1888788"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693464"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2013.6495002"},{"key":"e_1_3_2_1_17_1","volume-title":"TRANSACT","author":"Demsky B.","year":"2010","unstructured":"B. Demsky and A. Dash . Evaluating Contention Management Using Discrete Event Simulation . In TRANSACT , 2010 . B. Demsky and A. Dash. Evaluating Contention Management Using Discrete Event Simulation. In TRANSACT, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810531"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1924421.1924440"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542494"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772970"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073863"},{"key":"e_1_3_2_1_24_1","first-page":"113","volume-title":"ISCA","author":"Hammond L.","year":"2004","unstructured":"L. Hammond , V. Wong , M. Chen , B. D. Carlstrom , J. D. Davis , B. Hertzberg , M. K. Prabhu , H. Wijaya , C. Kozyrakis , and K. Olukotun . Transactional Memory Coherence and Consistency . In ISCA , pages 102\u2013 113 , 2004 . L. Hammond, V. Wong, M. Chen, B. D. Carlstrom, J. D. Davis, B. Hertzberg, M. K. Prabhu, H. Wijaya, C. Kozyrakis, and K. Olukotun. Transactional Memory Coherence and Consistency. In ISCA, pages 102\u2013113, 2004."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/949305.949340"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065954"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855056"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133984"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.30"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1178597.1178611"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/582419.582433"},{"issue":"2","key":"e_1_3_2_1_34_1","article-title":"Deuce","volume":"5","author":"Korland G.","year":"2010","unstructured":"G. Korland , N. Shavit , and P. Felber . Deuce : Noninvasive Software Transactional Memory in Java. Transactions on HiPEAC , 5 ( 2 ), 2010 . G. Korland, N. Shavit, and P. Felber. Deuce: Noninvasive Software Transactional Memory in Java. Transactions on HiPEAC, 5(2), 2010.","journal-title":"Noninvasive Software Transactional Memory in Java. Transactions on HiPEAC"},{"key":"e_1_3_2_1_35_1","volume-title":"TRANSACT","author":"Marathe V. J.","year":"2006","unstructured":"V. J. Marathe , M. F. Spear , C. Heriot , A. Acharya , D. Eisenstat , W. N. Scherer III, and M. L. Scott . Lowering the Overhead of Nonblocking Software Transactional Memory . In TRANSACT , 2006 . V. J. Marathe, M. F. Spear, C. Heriot, A. Acharya, D. Eisenstat, W. N. Scherer III, and M. L. Scott. Lowering the Overhead of Nonblocking Software Transactional Memory. In TRANSACT, 2006."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378588"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402227.1402235"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2006.1598134"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328448"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250684"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1299042.1299063"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989500"},{"key":"e_1_3_2_1_43_1","first-page":"292","volume-title":"CPA","author":"Ritson C. G.","year":"2013","unstructured":"C. G. Ritson and F. R. Barnes . An Evaluation of Intel\u2019s Restricted Transactional Memory for CPAs . In CPA , pages 271\u2013 292 , 2013 . C. G. Ritson and F. R. Barnes. An Evaluation of Intel\u2019s Restricted Transactional Memory for CPAs. In CPA, pages 271\u2013292, 2013."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167496"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123001"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/237090.237179"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449779"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694379"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250744"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504199"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281161"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378583"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2009.20"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/504282.504288"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442528"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370836"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2007.4"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503232"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378582"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854273.1854311"}],"event":{"name":"PPoPP '15: 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"San Francisco CA USA","acronym":"PPoPP '15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688500.2688510","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688500.2688510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:55:45Z","timestamp":1750258545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688500.2688510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,24]]},"references-count":60,"alternative-id":["10.1145\/2688500.2688510","10.1145\/2688500"],"URL":"https:\/\/doi.org\/10.1145\/2688500.2688510","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2858788.2688510","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,1,24]]},"assertion":[{"value":"2015-01-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}