{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:45:14Z","timestamp":1773193514039,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"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,6,17]]},"DOI":"10.1145\/3558481.3591079","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"187-197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"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":"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":"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":"University of Rochester, Rochester, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_3_1_1","volume-title":"Nonblocking Persistent Software Transactional Memory. In 27th Intl. Conf. on High Performance Computing, Data, and Analytics (HiPC). virtual conference, 283--293","author":"Beadle H. Alan","unstructured":"H. Alan Beadle, Wentao Cai, Haosen Wen, and Michael L. Scott. 2020. Nonblocking Persistent Software Transactional Memory. In 27th Intl. Conf. on High Performance Computing, Data, and Analytics (HiPC). virtual conference, 283--293."},{"key":"e_1_3_2_3_2_1","first-page":"1","article-title":"Fast Nonblocking 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 Nonblocking 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_3_3_1","volume-title":"Lock-free Concurrent Level Hashing for Persistent Memory. In Usenix Annual Technical Conf. (ATC). virtual conference, 799--812","author":"Chen Zhangyu","year":"2020","unstructured":"Zhangyu Chen, Yu Huang, Bo Ding, and Pengfei Zuo. 2020. Lock-free Concurrent Level Hashing for Persistent Memory. In Usenix Annual Technical Conf. (ATC). virtual conference, 799--812."},{"key":"e_1_3_2_3_4_1","volume-title":"Non-volatile Memories. In 16th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS)","author":"Coburn Joel","year":"2011","unstructured":"Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laura M. Grupp, Rajesh K. Gupta, Ranjit Jhala, and Steven Swanson. 2011. NV-Heaps: Making Persistent Objects Fast and Safe with Next-generation, Non-volatile Memories. In 16th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). Newport Beach, CA, 105--118."},{"key":"e_1_3_2_3_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210392"},{"key":"e_1_3_2_3_6_1","unstructured":"The Transaction Processing Council. 2010. TPC-C Benchmark (Revision 5.11.0). http:\/\/www.tpc.org\/tpcc\/."},{"key":"e_1_3_2_3_7_1","first-page":"4","article-title":"A Skip List for Multicore","volume":"29","author":"Dick Ian","year":"2016","unstructured":"Ian Dick, Alan Fekete, and Vincent Gramoli. 2016. A Skip List for Multicore. Concurrency and Computation: Practice and Experience, Vol. 29, 4 (May 2016), 20 pages.","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"e_1_3_2_3_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3301491"},{"key":"e_1_3_2_3_9_1","volume-title":"Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. In 31st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA)","author":"Fatourou Panagiota","year":"2019","unstructured":"Panagiota Fatourou, Elias Papavasileiou, and Eric Ruppert. 2019. Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. In 31st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA). Phoenix, AZ, 275--286."},{"key":"e_1_3_2_3_10_1","volume-title":"February","author":"Fraser Keir","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_3_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386031"},{"key":"e_1_3_2_3_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178490"},{"key":"e_1_3_2_3_13_1","volume-title":"Mirror: Making Lock-Free Data Structures Persistent. In 42nd ACM Conf. on Programming Language Design and Implementation (PLDI). virtual conference, 1218--1232","author":"Friedman Michal","year":"2021","unstructured":"Michal Friedman, Erez Petrank, and Pedro Ramalhete. 2021. Mirror: Making Lock-Free Data Structures Persistent. In 42nd ACM Conf. on Programming Language Design and Implementation (PLDI). virtual conference, 1218--1232."},{"key":"e_1_3_2_3_14_1","volume-title":"On the Correctness of Transactional Memory. In 13th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP)","author":"Guerraoui Rachid","year":"2008","unstructured":"Rachid Guerraoui and Michal Kapalka. 2008. On the Correctness of Transactional Memory. In 13th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP). Salt Lake City, UT, 175--184."},{"key":"e_1_3_2_3_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/289.291"},{"key":"e_1_3_2_3_16_1","volume-title":"16th Intl. Symp. on Distributed Computing (DISC)","author":"Harris Timothy L.","unstructured":"Timothy L. Harris, Keir Fraser, and Ian A. Pratt. 2002. A Practical Multi-word Compare-and-Swap Operation. In 16th Intl. Symp. on Distributed Computing (DISC). Toulouse, France, 265--279."},{"key":"e_1_3_2_3_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_3_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345237"},{"key":"e_1_3_2_3_19_1","volume-title":"Software Transactional Memory for Dynamic-sized Data Structures. In 22nd ACM Symp. on Principles of Distributed Computing (PODC)","author":"Herlihy Maurice","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_3_20_1","volume-title":"Halo: A Hybrid PMem-DRAM Persistent Hash Index with Fast Recovery. In Intl Conf on Management of Data (SIGMOD)","author":"Hu Daokun","year":"2022","unstructured":"Daokun Hu, Zhiwen Chen, Wenkui Che, Jianhua Sun, and Hao Chen. 2022. Halo: A Hybrid PMem-DRAM Persistent Hash Index with Fast Recovery. In Intl Conf on Management of Data (SIGMOD). Philadelphia, PA, 1049--1063."},{"key":"e_1_3_2_3_21_1","volume-title":"30th Intl. Symp. on Distributed Computing (DISC)","author":"Izraelevitz Joseph","unstructured":"Joseph Izraelevitz, Hammurabi Mendes, and Michael L. Scott. 2016. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. In 30th Intl. Symp. on Distributed Computing (DISC). Paris, France, 313--327."},{"key":"e_1_3_2_3_22_1","volume-title":"Zixuan Wang, Yi Xu, Subramanya R. Dulloor, Jishen Zhao, and Steven Swanson.","author":"Izraelevitz Joseph","year":"2019","unstructured":"Joseph Izraelevitz, Jian Yang, Lu Zhang, Juno Kim, Xiao Liu, Amirsaman Memaripour, Yun Joon Soh, Zixuan Wang, Yi Xu, Subramanya R. Dulloor, Jishen Zhao, and Steven Swanson. 2019. Basic Performance Measurements of the Intel Optane DC Persistent Memory Module. arXiv preprint arXiv:1903.05714v3."},{"key":"e_1_3_2_3_23_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_3_24_1","volume-title":"22nd Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). Xi'an, China, 329--343","author":"Liu Mengxing","year":"2017","unstructured":"Mengxing Liu, Mingxing Zhang, Kang Chen, Xuehai Qian, Yongwei Wu, Weimin Zheng, and Jinglei Ren. 2017. Dude\u2122: Building Durable Transactions with Decoupling for Persistent Memory. In 22nd Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). Xi'an, China, 329--343."},{"key":"e_1_3_2_3_25_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."},{"key":"e_1_3_2_3_26_1","volume-title":"Lowering the Overhead of Software Transactional Memory. In 1st ACM SIGPLAN Workshop on Transactional Computing (TRANSACT)","author":"Marathe Virendra J.","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_3_27_1","volume-title":"Read Copy Update. In Ottawa Linux Symp","author":"McKenney Paul E.","year":"2001","unstructured":"Paul E. McKenney, Dipankar Sarma, Andrea Arcangeli, Andi Kleen, Orran Krieger, and Rusty Russell. 2001. Read Copy Update. In Ottawa Linux Symp. Ottawa, ON, Canada, 338--367."},{"key":"e_1_3_2_3_28_1","volume-title":"High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In 14th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA). Winnipeg, MB, Canada, 73--82","author":"Michael Maged M.","year":"2002","unstructured":"Maged M. Michael. 2002. High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In 14th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA). Winnipeg, MB, Canada, 73--82."},{"key":"e_1_3_2_3_29_1","volume-title":"15th ACM Symp. on Principles of Distributed Computing (PODC)","author":"Maged","unstructured":"Maged M. Michael and Michael L. Scott. 1996. Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In 15th ACM Symp. on Principles of Distributed Computing (PODC). Philadelphia, PA, 267--275."},{"key":"e_1_3_2_3_30_1","volume-title":"STAMP: Stanford Transactional Applications for Multi-Processing. In IEEE Intl. Symp. on Workload Characterization (IISWC)","author":"Minh Chi Cao","year":"2008","unstructured":"Chi Cao Minh, JaeWoong Chung, Christos Kozyrakis, and Kunle Olukotun. 2008. STAMP: Stanford Transactional Applications for Multi-Processing. In IEEE Intl. Symp. on Workload Characterization (IISWC). Seattle, WA, 35--46."},{"key":"e_1_3_2_3_31_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_3_32_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_3_33_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_3_34_1","unstructured":"Michael L. Scott. 2013. Shared-Memory Synchronization. Morgan & Claypool Publishers San Rafael CA."},{"key":"e_1_3_2_3_35_1","volume-title":"14th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP)","author":"Spear Michael F.","unstructured":"Michael F. Spear, Luke Dalessandro, Virendra J. Marathe, and Michael L. Scott. 2009. A Comprehensive Contention Management Strategy for Software Transactional Memory. In 14th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP). Raleigh, NC, 141--150."},{"key":"e_1_3_2_3_36_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_3_37_1","volume-title":"21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA). Calgary, AB, Canada, 204--213","author":"Tabba Fuad","year":"2009","unstructured":"Fuad Tabba, Mark Moir, James R. Goodman, Andrew W. Hay, and Cong Wang. 2009. NZ\u2122: Nonblocking Zero-indirection Transactional Memory. In 21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA). Calgary, AB, Canada, 204--213."},{"key":"e_1_3_2_3_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555261"},{"key":"e_1_3_2_3_39_1","volume-title":"Speedy Transactions in Multicore In-Memory Databases. In 24th ACM Symp. on Operating Systems Principles (SOSP)","author":"Tu Stephen","year":"2013","unstructured":"Stephen Tu, Wenting Zheng, Eddie Kohler, Barbara Liskov, and Samuel Madden. 2013. Speedy Transactions in Multicore In-Memory Databases. In 24th ACM Symp. on Operating Systems Principles (SOSP). Farminton, PA, 18--32."},{"key":"e_1_3_2_3_40_1","volume-title":"Mnemosyne: Lightweight Persistent Memory. In 16th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS)","author":"Volos Haris","unstructured":"Haris Volos, Andres Jaan Tack, and Michael M. Swift. 2011. Mnemosyne: Lightweight Persistent Memory. In 16th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). Newport Beach, CA, 91--104."},{"key":"e_1_3_2_3_41_1","volume-title":"Characterizing and Modeling Non-Volatile Memory Systems. In 53rd Intl. Symp. on Microarchitecture (MICRO). virtual conference, 496--508","author":"Wang Zixuan","year":"2020","unstructured":"Zixuan Wang, Xiao Liu, Jian Yang, Theodore Michailidis, Steven Swanson, and Jishen Zhao. 2020. Characterizing and Modeling Non-Volatile Memory Systems. In 53rd Intl. Symp. on Microarchitecture (MICRO). virtual conference, 496--508."},{"key":"e_1_3_2_3_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735511"},{"key":"e_1_3_2_3_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935780"},{"key":"e_1_3_2_3_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360554"}],"event":{"name":"SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Orlando FL USA","acronym":"SPAA '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591079","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591079","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:33Z","timestamp":1750182573000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":44,"alternative-id":["10.1145\/3558481.3591079","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591079","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}