{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:48Z","timestamp":1750307508224,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"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.1584013","type":"proceedings-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T18:34:59Z","timestamp":1250534099000},"page":"59-68","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["On avoiding spare aborts in transactional memory"],"prefix":"10.1145","author":[{"given":"Idit","family":"Keidar","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitri","family":"Perelman","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"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\/1146381.1146428"},{"volume-title":"Second ACM SIGPLAN Workshop on Transactional Computing","year":"2008","author":"Aydonat U.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_4_1","unstructured":"R. Ennals. Cache sensitive software transactional memory. Technical report Intel.  R. Ennals. Cache sensitive software transactional memory. Technical report Intel."},{"volume-title":"Cambridge","year":"2004","author":"Fraser K.","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92221-6_33"},{"volume-title":"DISC","year":"2008","author":"Guerraoui R.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345233"},{"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\/173682.165164"},{"volume-title":"Workshop on Memory Performance Issues (WMPI'06)","year":"2006","author":"Moss J. E. B.","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","unstructured":"J. Napper and L. Alvisi. Lock-free serializable transactions. Technical report The University of Texas at Austin 2005.  J. Napper and L. Alvisi. Lock-free serializable transactions. Technical report The University of Texas at Austin 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"T. Riegel C. Fetzer H. Sturzrehm and P. Felber. From causal to z-linearizable transactional memory. Technical report Universit&amp;#233; de Neuch&amp;#226;tel 2007.  T. Riegel C. Fetzer H. Sturzrehm and P. Felber. From causal to z-linearizable transactional memory. Technical report Universit&amp;#233; de Neuch&amp;#226;tel 2007.","DOI":"10.1145\/1281100.1281162"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224987"},{"journal-title":"Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery.","year":"2002","author":"Weikum G.","key":"e_1_3_2_1_17_1"}],"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.1584013","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1583991.1584013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:58Z","timestamp":1750249078000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1584013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,11]]},"references-count":16,"alternative-id":["10.1145\/1583991.1584013","10.1145\/1583991"],"URL":"https:\/\/doi.org\/10.1145\/1583991.1584013","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"}}]}}