{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:37:16Z","timestamp":1750307836663,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,10,18]],"date-time":"2007-10-18T00:00:00Z","timestamp":1192665600000},"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":[[2007,10,18]]},"DOI":"10.1145\/1376789.1376798","type":"proceedings-article","created":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T18:03:27Z","timestamp":1212516207000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Why the grass may not be greener on the other side"],"prefix":"10.1145","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":"Jonathan","family":"Walpole","sequence":"additional","affiliation":[{"name":"Portland State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,10,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"USENIX Conference Proceedings","author":"Beck B.","year":"1985","unstructured":"Beck , B. , and Kasten , B . VLSI assist in building a multiprocessor UNIX system . In USENIX Conference Proceedings ( Portland, OR , June 1985 ), USENIX Association, pp. 255--275. Beck, B., and Kasten, B. VLSI assist in building a multiprocessor UNIX system. In USENIX Conference Proceedings (Portland, OR, June 1985), USENIX Association, pp. 255--275."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065011"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645959.676129"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/355620.361161"},{"key":"e_1_3_2_1_7_1","volume-title":"USENIX Conference Proceedings","author":"Inman J.","year":"1985","unstructured":"Inman , J. Implementing loosely coupled functions on tightly coupled engines . In USENIX Conference Proceedings ( Portland, OR , June 1985 ), USENIX Association, pp. 277--298. Inman, J. Implementing loosely coupled functions on tightly coupled engines. In USENIX Conference Proceedings (Portland, OR, June 1985), USENIX Association, pp. 277--298."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/244764.244765"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/358818.358824"},{"key":"e_1_3_2_1_10_1","volume-title":"TRANSACT: the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (June","author":"Marathe V. J.","year":"2006","unstructured":"Marathe , V. J. , Spear , M. F. , Heriot , C. , Acharya , A. , Eisenstat , D. , Scherer III, W. N. , and Scott , M. L . Lowering the overhead of nonblocking software transactional memory . In TRANSACT: the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (June 2006 ), ACM SIGPLAN. Marathe, V. J., Spear, M. F., Heriot, C., Acharya, A., Eisenstat, D., Scherer III, W. N., and Scott, M. L. Lowering the overhead of nonblocking software transactional memory. In TRANSACT: the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (June 2006), ACM SIGPLAN."},{"key":"e_1_3_2_1_11_1","first-page":"501","volume-title":"Pattern Languages of Program Design","author":"McKenney P. E.","year":"1996","unstructured":"McKenney , P. E. Pattern Languages of Program Design , vol. 2 . Addison-Wesley , June 1996 , ch. 31: Selecting Locking Designs for Parallel Programs, pp. 501 -- 531 . McKenney, P. E. Pattern Languages of Program Design, vol. 2. Addison-Wesley, June 1996, ch. 31: Selecting Locking Designs for Parallel Programs, pp. 501--531."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2006.1598134"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073861"}],"event":{"name":"PLOS07: Workshop on Programming Languages and Operating Systems","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Stevenson Washington","acronym":"PLOS07"},"container-title":["Proceedings of the 4th workshop on Programming languages and operating systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376789.1376798","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376789.1376798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:58:01Z","timestamp":1750255081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376789.1376798"}},"subtitle":["a comparison of locking vs. transactional memory"],"short-title":[],"issued":{"date-parts":[[2007,10,18]]},"references-count":14,"alternative-id":["10.1145\/1376789.1376798","10.1145\/1376789"],"URL":"https:\/\/doi.org\/10.1145\/1376789.1376798","relation":{},"subject":[],"published":{"date-parts":[[2007,10,18]]},"assertion":[{"value":"2007-10-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}