{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:19Z","timestamp":1772163979687,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,1,9]],"date-time":"2010-01-09T00:00:00Z","timestamp":1262995200000},"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":[[2010,1,9]]},"DOI":"10.1145\/1693453.1693465","type":"proceedings-article","created":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T15:23:12Z","timestamp":1263309792000},"page":"79-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Scheduling support for transactional memory contention management"],"prefix":"10.1145","author":[{"given":"Walther","family":"Maldonado","sequence":"first","affiliation":[{"name":"University of Neuchatel, Neuchatel, Switzerland"}]},{"given":"Patrick","family":"Marlier","sequence":"additional","affiliation":[{"name":"University of Neuchatel, Neuchatel, Switzerland"}]},{"given":"Pascal","family":"Felber","sequence":"additional","affiliation":[{"name":"University of Neuchatel, Neuchatel, Switzerland"}]},{"given":"Adi","family":"Suissa","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Beer-Sheva, Israel"}]},{"given":"Danny","family":"Hendler","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Beer-Sheva, Israel"}]},{"given":"Alexandra","family":"Fedorova","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, Canada"}]},{"given":"Julia L.","family":"Lawall","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}]},{"given":"Gilles","family":"Muller","sequence":"additional","affiliation":[{"name":"INRIA, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2010,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189276.1189288"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92990-1_3"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of 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 Proceedings of IISWC , September 2008 . Chi Cao Minh, JaeWoong Chung, Christos Kozyrakis, and Kunle Olukotun. STAMP: Stanford transactional applications for multi-processing. In Proceedings of IISWC, September 2008."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400769"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582725"},{"key":"e_1_3_2_1_7_1","volume-title":"Software transactional memory should not be obstruction--free. Technical report","author":"Ennals Robert","year":"2006","unstructured":"Robert Ennals . Software transactional memory should not be obstruction--free. Technical report , Intel Research Cambridge, 2006 . IRC--TR-- 06--052. Robert Ennals. Software transactional memory should not be obstruction--free. Technical report, Intel Research Cambridge, 2006. IRC--TR--06--052."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345241"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273029"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364782.1364800"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294271"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073861"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073861"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224987"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378564"}],"event":{"name":"PPoPP '10: ACM SIGPLAN Principles and Practice of Parallel Computing","location":"Bangalore India","acronym":"PPoPP '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1693453.1693465","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1693453.1693465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:45:35Z","timestamp":1750236335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1693453.1693465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,9]]},"references-count":19,"alternative-id":["10.1145\/1693453.1693465","10.1145\/1693453"],"URL":"https:\/\/doi.org\/10.1145\/1693453.1693465","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1837853.1693465","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,1,9]]},"assertion":[{"value":"2010-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}