{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:08Z","timestamp":1750307468709,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,8,17]],"date-time":"2010-08-17T00:00:00Z","timestamp":1282003200000},"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":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2010,8,17]]},"abstract":"<jats:p>The advent of multi-core and multi-threaded processor architectures highlights the need to address the well-known shortcomings of the ubiquitous lock-based synchronization mechanisms. To this end, transactional memory has been viewed by many as a promising alternative to locking. This paper therefore presents a constructive critique of locking and transactional memory: their strengths, weaknesses, and opportunities for improvement.<\/jats:p>","DOI":"10.1145\/1842733.1842749","type":"journal-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T13:12:46Z","timestamp":1282223566000},"page":"93-101","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Why the grass may not be greener on the other side"],"prefix":"10.1145","volume":"44","author":[{"given":"Paul E.","family":"McKenney","sequence":"first","affiliation":[{"name":"IBM Beaverton"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maged M.","family":"Michael","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josh","family":"Triplett","sequence":"additional","affiliation":[{"name":"Portland State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Walpole","sequence":"additional","affiliation":[{"name":"Portland State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,8,17]]},"reference":[{"volume-title":"USENIX Conference Proceedings","year":"1985","author":"Beck B.","key":"e_1_2_1_1_1"},{"volume-title":"The kernel lock validator. Available: http:\/\/lwn.net\/Articles\/185666\/ {Viewed","year":"2010","author":"Corbet J.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.472.0221"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/161468.161469"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065011"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645959.676129"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/355620.361161"},{"volume-title":"USENIX Conference Proceedings","year":"1985","author":"Inman J.","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/244764.244765"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/358818.358824"},{"volume-title":"TRANSACT: the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (June 2006","year":"2006","author":"Marathe V. J.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.69"},{"key":"e_1_2_1_16_1","first-page":"501","volume-title":"Pattern Languages of Program Design","author":"McKenney P. E.","year":"1996"},{"volume-title":"Australia","year":"2009","author":"McKenney P. E.","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376789.1376798"},{"key":"e_1_2_1_20_1","first-page":"509","volume-title":"NV","author":"McKenney P. E.","year":"1998"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2006.1598134"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629591"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073861"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281161"},{"volume-title":"3rd ACM SIGPLAN Workshop on Transactional Computing","year":"2008","author":"Spear M.","key":"e_1_2_1_26_1"},{"volume-title":"3rd ACM SIGPLAN Workshop on Transactional Computing","year":"2008","author":"Volos H.","key":"e_1_2_1_27_1"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378582"}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1842733.1842749","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1842733.1842749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:36Z","timestamp":1750248516000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1842733.1842749"}},"subtitle":["a comparison of locking vs. transactional memory"],"short-title":[],"issued":{"date-parts":[[2010,8,17]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,8,17]]}},"alternative-id":["10.1145\/1842733.1842749"],"URL":"https:\/\/doi.org\/10.1145\/1842733.1842749","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2010,8,17]]},"assertion":[{"value":"2010-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}