{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:09Z","timestamp":1750220049556,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:00:00Z","timestamp":1676937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1717712, CNS-1900803, and CNS-1955498"],"award-info":[{"award-number":["CCF-1717712, CNS-1900803, and CNS-1955498"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,2,25]]},"DOI":"10.1145\/3572848.3577503","type":"proceedings-article","created":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T16:02:30Z","timestamp":1676995350000},"page":"441-443","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Transactional Composition of Nonblocking Data Structures"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7929-2653","authenticated-orcid":false,"given":"Wentao","family":"Cai","sequence":"first","affiliation":[{"name":"Computer Science Department, University of Rochester, Rochester, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7118-1206","authenticated-orcid":false,"given":"Haosen","family":"Wen","sequence":"additional","affiliation":[{"name":"Computer Science Department, University of Rochester, Rochester, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8652-7644","authenticated-orcid":false,"given":"Michael L.","family":"Scott","sequence":"additional","affiliation":[{"name":"Computer Science Department, University of Rochester, Rochester, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Fast Non-blocking Persistence for Concurrent Data Structures. In 35th Intl. Symp. on Distributed Computing (DISC). Freiburg","volume":"14","author":"Cai Wentao","year":"2021","unstructured":"Wentao Cai, Haosen Wen, Vladimir Maksimovski, Mingzhe Du, Rafaello Sanna, Shreif Abdallah, and Michael L. Scott. 2021. Fast Non-blocking Persistence for Concurrent Data Structures. In 35th Intl. Symp. on Distributed Computing (DISC). Freiburg, Germany, 14:1--14:20.","journal-title":"Germany"},{"key":"e_1_3_2_1_2_1","volume-title":"Scott","author":"Cai Wentao","year":"2023","unstructured":"Wentao Cai, Haosen Wen, and Michael L. Scott. 2023. Transactional Composition of Nonblocking Data Structures. arXiv preprint arXiv:2301.00996."},{"key":"e_1_3_2_1_3_1","unstructured":"The Transaction Processing Council. 2010. TPC-C Benchmark (Revision 5.11.0). http:\/\/www.tpc.org\/tpcc\/."},{"key":"e_1_3_2_1_4_1","volume-title":"February","author":"Keir Fraser. 2003. Practical Lock-Freedom. Ph.D. Dissertation. King's College","year":"2004","unstructured":"Keir Fraser. 2003. Practical Lock-Freedom. Ph.D. Dissertation. King's College, Univ. of Cambridge. Published as Univ. of Cambridge Computer Laboratory technical report #579, February 2004. www.cl.cam.ac.uk\/techreports\/UCAM-CL-TR-579.pdf."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386031"},{"volume-title":"16th Intl. Symp. on Distributed Computing (DISC)","author":"Harris Timothy L.","key":"e_1_3_2_1_6_1","unstructured":"Timothy L. Harris, Keir Fraser, and Ian A. Pratt. 2002. A Practical Multiword Compare-and-Swap Operation. In 16th Intl. Symp. on Distributed Computing (DISC). Toulouse, France, 265--279."},{"volume-title":"Software Transactional Memory for Dynamic-sized Data Structures. In 22nd ACM Symp. on Principles of Distributed Computing (PODC)","author":"Herlihy Maurice","key":"e_1_3_2_1_7_1","unstructured":"Maurice Herlihy, Victor Luchangco, Mark Moir, and William N. Scherer III. 2003. Software Transactional Memory for Dynamic-sized Data Structures. In 22nd ACM Symp. on Principles of Distributed Computing (PODC). Boston, MA, 92--101."},{"key":"e_1_3_2_1_8_1","volume-title":"Wait-Free Dynamic Transactions for Linked Data Structures. In 10th Intl. Workshop on Programming Models and Applications for Multicores and Manycores (PMAM)","author":"LaBorde Pierre","year":"2019","unstructured":"Pierre LaBorde, Lance Lebanoff, Christina Peterson, Deli Zhang, and Damian Dechev. 2019. Wait-Free Dynamic Transactions for Linked Data Structures. In 10th Intl. Workshop on Programming Models and Applications for Multicores and Manycores (PMAM). Washington, DC, 41--50."},{"key":"e_1_3_2_1_9_1","volume-title":"Toward High Performance Nonblocking Software Transactional Memory. In 13th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP)","author":"Marathe Virendra Jayant","year":"2008","unstructured":"Virendra Jayant Marathe and Mark Moir. 2008. Toward High Performance Nonblocking Software Transactional Memory. In 13th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP). Salt Lake City, UT, 227--236."},{"volume-title":"Lowering the Overhead of Software Transactional Memory. In 1st ACM SIGPLAN Workshop on Transactional Computing (TRANSACT)","author":"Marathe Virendra J.","key":"e_1_3_2_1_10_1","unstructured":"Virendra J. Marathe, Michael F. Spear, Christopher Heriot, Athul Acharya, David Eisenstat, William N. Scherer III, and Michael L. Scott. 2006. Lowering the Overhead of Software Transactional Memory. In 1st ACM SIGPLAN Workshop on Transactional Computing (TRANSACT). Ottawa, ON, Canada, 11 pages."},{"key":"e_1_3_2_1_11_1","volume-title":"Fast Concurrent Lock-free Binary Search Trees. In 19th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP)","author":"Natarajan Aravind","year":"2014","unstructured":"Aravind Natarajan and Neeraj Mittal. 2014. Fast Concurrent Lock-free Binary Search Trees. In 19th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP). Orlando, FL, 317--328."},{"key":"e_1_3_2_1_12_1","first-page":"1","article-title":"Dal\u00ed: A Periodically Persistent Hash Map. In 31st Intl. Symp. on Distributed Computing (DISC). Vienna","volume":"37","author":"Nawab Faisal","year":"2017","unstructured":"Faisal Nawab, Joseph Izraelevitz, Terence Kelly, Charles B. Morrey III, Dhruva R. Chakrabarti, and Michael L. Scott. 2017. Dal\u00ed: A Periodically Persistent Hash Map. In 31st Intl. Symp. on Distributed Computing (DISC). Vienna, Austria, 37:1--37:16.","journal-title":"Austria"},{"key":"e_1_3_2_1_13_1","volume-title":"OneFile: A Wait-Free Persistent Transactional Memory. In 49th IEEE\/IFIP Intl. Conf. on Dependable Systems and Networks (DSN)","author":"Ramalhete Pedro","year":"2019","unstructured":"Pedro Ramalhete, Andreia Correia, Pascal Felber, and Nachshon Cohen. 2019. OneFile: A Wait-Free Persistent Transactional Memory. In 49th IEEE\/IFIP Intl. Conf. on Dependable Systems and Networks (DSN). Portland, OR, 151--163."},{"key":"e_1_3_2_1_14_1","unstructured":"Michael L. Scott. 2013. Shared-Memory Synchronization. Morgan & Claypool Publishers San Rafael CA."},{"key":"e_1_3_2_1_15_1","volume-title":"Transactional Data Structure Libraries. In 37th ACM Conf. on Programming Language Design and Implementation (PLDI)","author":"Spiegelman Alexander","year":"2016","unstructured":"Alexander Spiegelman, Guy Golan-Gueta, and Idit Keidar. 2016. Transactional Data Structure Libraries. In 37th ACM Conf. on Programming Language Design and Implementation (PLDI). Santa Barbara, CA, 682--696."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584048"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555261"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935780"}],"event":{"name":"PPoPP '23: The 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Montreal QC Canada","acronym":"PPoPP '23"},"container-title":["Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572848.3577503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3572848.3577503","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3572848.3577503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:09Z","timestamp":1750183689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572848.3577503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,21]]},"references-count":18,"alternative-id":["10.1145\/3572848.3577503","10.1145\/3572848"],"URL":"https:\/\/doi.org\/10.1145\/3572848.3577503","relation":{},"subject":[],"published":{"date-parts":[[2023,2,21]]},"assertion":[{"value":"2023-02-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}