{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:49Z","timestamp":1763467849709,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,14]],"date-time":"2008-06-14T00:00:00Z","timestamp":1213401600000},"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":[[2008,6,14]]},"DOI":"10.1145\/1378533.1378587","type":"proceedings-article","created":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T13:49:02Z","timestamp":1213710542000},"page":"304-313","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["On obstruction-free transactions"],"prefix":"10.1145","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"Michal","family":"Kapalka","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2008,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"RSTM--the Rochester software transactional memory runtime. http:\/\/www.cs.rochester.edu\/research\/synchronization\/rstm.  RSTM--the Rochester software transactional memory runtime. http:\/\/www.cs.rochester.edu\/research\/synchronization\/rstm."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248096"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/259380.259431"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281107"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146427"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_11"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_3"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the Workshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL)","author":"Cachopo J.","year":"2005","unstructured":"J. Cachopo and A. Rito-Silva . Versioned boxes as the basis for memory transactions . In Proceedings of the Workshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL) , 2005 . J. Cachopo and A. Rito-Silva. Versioned boxes as the basis for memory transactions. In Proceedings of the Workshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL), 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 1st ACM SIGPLAN Workshop on Transactional Computing (TRANSACT)","author":"Dice D.","year":"2006","unstructured":"D. Dice and N. Shavit . What really makes transactions fast ? In Proceedings of the 1st ACM SIGPLAN Workshop on Transactional Computing (TRANSACT) , 2006 . D. Dice and N. Shavit. What really makes transactions fast? In Proceedings of the 1st ACM SIGPLAN Workshop on Transactional Computing (TRANSACT), 2006."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345241"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_15_1","volume-title":"EPFL","author":"Guerraoui R.","year":"2008","unstructured":"R. Guerraoui and M. Kapalka . On obstruction-free transactions. Technical report , EPFL , 2008 . R. Guerraoui and M. Kapalka. On obstruction-free transactions. Technical report, EPFL, 2008."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345233"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/850929.851942"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198079"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263888"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01719-3","volume-title":"Transactional Memory. Morgan &amp","author":"Larus J. R.","year":"2007","unstructured":"J. R. Larus and R. Rajwar . Transactional Memory. Morgan &amp ; Claypool , 2007 . J. R. Larus and R. Rajwar. Transactional Memory. Morgan & Claypool, 2007."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_26"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277736"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224987"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the 2nd ACM SIGPLAN Workshop on Transactional Computing (TRANSACT)","author":"Tabba F.","year":"2007","unstructured":"F. Tabba , C. Wang , J. R. Goodman , and M. Moir . NZTM: nonblocking zero-indirection transactional memory . In Proceedings of the 2nd ACM SIGPLAN Workshop on Transactional Computing (TRANSACT) , 2007 . F. Tabba, C. Wang, J. R. Goodman, and M. Moir. NZTM: nonblocking zero-indirection transactional memory. In Proceedings of the 2nd ACM SIGPLAN Workshop on Transactional Computing (TRANSACT), 2007."}],"event":{"name":"SPAA08: 20th 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":"Munich Germany","acronym":"SPAA08"},"container-title":["Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378587","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1378533.1378587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:54Z","timestamp":1750258674000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,14]]},"references-count":29,"alternative-id":["10.1145\/1378533.1378587","10.1145\/1378533"],"URL":"https:\/\/doi.org\/10.1145\/1378533.1378587","relation":{},"subject":[],"published":{"date-parts":[[2008,6,14]]},"assertion":[{"value":"2008-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}