{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T18:45:15Z","timestamp":1783536315695,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T00:00:00Z","timestamp":1783296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1901381"],"award-info":[{"award-number":["CCF-1901381"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1910030"],"award-info":[{"award-number":["CCF-1910030"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1919223"],"award-info":[{"award-number":["CCF-1919223"]}],"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":[[2026,7,6]]},"DOI":"10.1145\/3816782.3819198","type":"proceedings-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:28:33Z","timestamp":1783531713000},"page":"102-115","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["uSTM: A Lightweight and Efficient STM Supporting General Types and Deferred Aborts"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6930-2930","authenticated-orcid":false,"given":"Zachary","family":"Kent","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0224-9187","authenticated-orcid":false,"given":"Guy","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"},{"name":"Google Research, New York City, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4998-1352","authenticated-orcid":false,"given":"Andr\u00e9","family":"Costa","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"},{"name":"NOVA LINCS, NOVA University Lisbon, Lisbon, Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454060"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577495"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/319996.319998"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3694906.3743341"},{"key":"e_1_3_2_1_5_1","volume-title":"VERLIB: Concurrent Vesioned Pointers. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP).","author":"Guy","unstructured":"Guy E. Blelloch and Yuanhao Wei. 2024. VERLIB: Concurrent Vesioned Pointers. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247684.2247688"},{"key":"e_1_3_2_1_7_1","unstructured":"Hans J. Boehm. 2020. Byte-wise atomic memcpy P1478R5. Webpage. https:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2020\/p1478r5.html"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.05.009"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400214.1400228"},{"key":"e_1_3_2_1_10_1","volume-title":"Multiverse: Transactional Memory with Dynamic Multiversioning. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP).","author":"Coccimiglio Gaetano","year":"2026","unstructured":"Gaetano Coccimiglio, Trevor Brown, and Srivatsan Ravi. 2026. Multiverse: Transactional Memory with Dynamic Multiversioning. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_12_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_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 2nd ACM SIGPLAN Workshop on Transactional Computing (TRANSACT).","author":"Dice Dave","year":"2010","unstructured":"Dave Dice, Alexander Matveev, and Nir Shavit. 2010. Implicit Privatization Using Private Transactions. In Proceedings of the 2nd ACM SIGPLAN Workshop on Transactional Computing (TRANSACT)."},{"key":"e_1_3_2_1_15_1","volume-title":"Transactional Locking II. In International Symposium on Distributed Computing (DISC).","author":"Dice Dave","year":"2006","unstructured":"Dave Dice, Ori Shalev, and Nir Shavit. 2006. Transactional Locking II. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_16_1","article-title":"Time-Warp: Efficient Abort Reduction in Transactional Memory","volume":"2","author":"Diegues Nuno","year":"2015","unstructured":"Nuno Diegues and Paolo Romano. 2015. Time-Warp: Efficient Abort Reduction in Transactional Memory. ACM Transactions on Parallel Computing (TOPC) 2, 2, Article 12 (June 2015), 44 pages.","journal-title":"ACM Transactions on Parallel Computing (TOPC)"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345241"},{"key":"e_1_3_2_1_18_1","volume-title":"Lock-Free and Scalable Multi-Version Software Transactional Memory. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP).","author":"Fernandes S\u00e9rgio Miguel","year":"2011","unstructured":"S\u00e9rgio Miguel Fernandes and Jo\u00e3o Cachopo. 2011. Lock-Free and Scalable Multi-Version Software Transactional Memory. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP)."},{"key":"e_1_3_2_1_19_1","unstructured":"Keir Fraser. 2004. Practical lock-freedom. Technical Report. University of Cambridge Computer Laboratory."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345233"},{"key":"e_1_3_2_1_21_1","volume-title":"Sansom","author":"Hall Cordelia","year":"1995","unstructured":"Cordelia Hall, Simon L. Peyton Jones, and Patrick M. Sansom. 1995. Unboxing using Specialisation. In Functional Programming, Glasgow 1994, Kevin Hammond, David N. Turner, and Patrick M. Sansom (Eds.). Springer London."},{"key":"e_1_3_2_1_22_1","volume-title":"Transactional Memory","author":"Harris Tim","unstructured":"Tim Harris, James Larus, and Ravi Rajwar. 2010. Transactional Memory, 2nd Edition. Morgan and Claypool Publishers.","edition":"2"},{"key":"e_1_3_2_1_23_1","unstructured":"Stephen Hemminger. 2012. Fast reader\/writer lock for gettimeofday 2.5.30. Linux kernel mailing list. https:\/\/lwn.net\/Articles\/7388\/."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.177874"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190510"},{"key":"e_1_3_2_1_26_1","unstructured":"Zachary Kent Guy Blelloch and Andr\u00e9 Costa. 2026. \u03bcSTM: A Lightweight and Efficient STM Supporting General Types and Deferred Aborts. The full paper version will be made available on arXiv.."},{"key":"e_1_3_2_1_27_1","unstructured":"B. W. Kernighan and D. M. Ritchie. 1988. The C Programming Language (2nd ed.) Chapter 8 (Appendix B). Prentice Hall."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178505"},{"key":"e_1_3_2_1_29_1","volume-title":"IEEE International Conference on Distributed Computing and Networking (ICDCN). 212\u2013226","author":"Kumar Priyanka","unstructured":"Priyanka Kumar, Sathya Peri, and K. Vidyasankar. 2014. A TimeStamp Based Multi-version STM Algorithm. In IEEE International Conference on Distributed Computing and Networking (ICDCN). 212\u2013226."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/320613.320619"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. of the Gelato Federation Meeting. http:\/\/lameter.com\/gelato2005","author":"Lameter C.","year":"2005","unstructured":"C. Lameter. 2005. Effective synchronization on Linux\/NUMA systems. In Proc. of the Gelato Federation Meeting. http:\/\/lameter.com\/gelato2005.pdf"},{"key":"e_1_3_2_1_33_1","volume-title":"The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases. In IEEE International Conference on Data Engineering (ICDE).","author":"Leis Viktor","year":"2013","unstructured":"Viktor Leis, Alfons Kemper, and Thomas Neumann. 2013. The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases. In IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_3_2_1_34_1","volume-title":"Cicada: Dependably Fast Multi-Core In-Memory Transactions. In ACM SIGMOD International Conference on Management of Data (SIGMOD). 21\u201335","author":"Lim Hyeontaek","unstructured":"Hyeontaek Lim, Michael Kaminsky, and David G. Andersen. 2017. Cicada: Dependably Fast Multi-Core In-Memory Transactions. In ACM SIGMOD International Conference on Management of Data (SIGMOD). 21\u201335."},{"key":"e_1_3_2_1_35_1","unstructured":"Linux Kernel Developers. [n. d.]. Linux Kernel Source Code File arch\/arm64\/include\/asm\/arch_timer.h Lines 200\u2013210. https:\/\/github.com\/torvalds\/linux\/blob\/8e65320d91cdc3b241d4b94855c88459b91abf66\/arch\/arm64\/include\/asm\/arch_timer.h#L200-L210."},{"key":"e_1_3_2_1_36_1","unstructured":"lisdair Meredith Mungo Gill Joshua Berne Corentin Jabot Pablo Halpern and Lori Hughes. 2025. Trivial Relocatability For C++26: Proposal to safely relocate objects in memory. https:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2025\/p2786r13.html."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_10"},{"key":"e_1_3_2_1_38_1","volume-title":"Fast Serializable Multi-version Concurrency Control for Main-Memory Database Systems. In ACM SIGMOD International Conference on Management of Data (SIGMOD).","author":"Neumann Thomas","year":"2015","unstructured":"Thomas Neumann, Tobias M\u00fchlbauer, and Alfons Kemper. 2015. Fast Serializable Multi-version Concurrency Control for Main-Memory Database Systems. In ACM SIGMOD International Conference on Management of Data (SIGMOD)."},{"key":"e_1_3_2_1_39_1","unstructured":"Arthur O'Dwyer. 2024. P1144R10: std::is_trivially_relocatable. https:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2024\/p1144r10.html."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Mikael Olsson. 2022. Boxing and Unboxing. Apress Berkeley CA 111\u2013112.","DOI":"10.1007\/978-1-4842-7371-5_22"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/348.318588"},{"key":"e_1_3_2_1_42_1","volume-title":"SMV: Selective Multi-Versioning STM. In International Symposium on Distributed Computing (DISC). 125\u2013140","author":"Perelman Dmitri","year":"2011","unstructured":"Dmitri Perelman, Anton Byshevsky, Oleg Litmanovich, and Idit Keidar. 2011. SMV: Selective Multi-Versioning STM. In International Symposium on Distributed Computing (DISC). 125\u2013140."},{"key":"e_1_3_2_1_43_1","volume-title":"On Maintaining Multiple Versions in STM. In ACM Symposium on Principles of Distributed Computing (PODC). 16\u201325","author":"Perelman Dmitri","year":"2010","unstructured":"Dmitri Perelman, Rui Fan, and Idit Keidar. 2010. On Maintaining Multiple Versions in STM. In ACM Symposium on Principles of Distributed Computing (PODC). 16\u201325."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367523"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627535.3638472"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577433"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00028"},{"key":"e_1_3_2_1_48_1","unstructured":"D. Reed. 1978. Naming and synchronization in a decentralized computer system. Technical Report LCS\/TR-205. EECS Dept. MIT."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_20"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3710848.3710873"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541228.2555297"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594835.1504199"},{"key":"e_1_3_2_1_53_1","volume-title":"ACM Symposium on Principles of Distributed Computing (PODC).","author":"Spear Michael F.","unstructured":"Michael F. Spear, Virendra J. Marathe, Luke Dalessandro, and Michael L. Scott. 2007. Privatization techniques for software transactional memory. In ACM Symposium on Principles of Distributed Computing (PODC)."},{"key":"e_1_3_2_1_54_1","volume-title":"The Design and Evolution of C++","author":"Stroustrup Bjarne","unstructured":"Bjarne Stroustrup. 1994. The Design and Evolution of C++. Addison-Wesley Professional, Reading, Massachusetts."},{"key":"e_1_3_2_1_55_1","unstructured":"Michael J. Sullivan. 2017. Low-level Concurrent Programming Using the Relaxed Memory Calculus. Ph.D. Dissertation. Carnegie Mellon University. CMU-CS-17-126."},{"key":"e_1_3_2_1_56_1","volume-title":"Practically and Theoretically Efficient Garbage Collection for Multiversioning. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP).","author":"Wei Yuanhao","year":"2023","unstructured":"Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, and Eric Ruppert. 2023. Practically and Theoretically Efficient Garbage Collection for Multiversioning. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP)."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067427"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882935"}],"event":{"name":"SPAA '26: 38th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Royal Holloway, University of London London United Kingdom","acronym":"SPAA '26","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","EATCS"]},"container-title":["Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816782.3819198","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816782.3819198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:30:27Z","timestamp":1783531827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3816782.3819198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,6]]},"references-count":58,"alternative-id":["10.1145\/3816782.3819198","10.1145\/3816782"],"URL":"https:\/\/doi.org\/10.1145\/3816782.3819198","relation":{},"subject":[],"published":{"date-parts":[[2026,7,6]]},"assertion":[{"value":"2026-07-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}