{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:14:15Z","timestamp":1760044455615,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:00:00Z","timestamp":1583712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/L01503X\/1"],"award-info":[{"award-number":["EP\/L01503X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,3,9]]},"DOI":"10.1145\/3373376.3378481","type":"proceedings-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T22:37:01Z","timestamp":1584139021000},"page":"1173-1186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Lazy Release Persistency"],"prefix":"10.1145","author":[{"given":"Mahesh","family":"Dananjaya","sequence":"first","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}]},{"given":"Vasilis","family":"Gavrielatos","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}]},{"given":"Arpit","family":"Joshi","sequence":"additional","affiliation":[{"name":"Intel, Portland, OR, USA"}]},{"given":"Vijay","family":"Nagarajan","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2020,3,13]]},"reference":[{"volume-title":"Lazy Persistency: A High-Performing and Write-Efficient Software Persistency Technique (ISCA '18)","year":"2018","author":"Alshboul Mohammad","key":"e_1_3_2_1_1_1"},{"volume-title":"Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot Be Eliminated (POPL '11)","year":"1926","author":"Attiya Hagit","key":"e_1_3_2_1_2_1"},{"volume-title":"The Parallel Persistent Memory Model (SPAA '18)","year":"2018","author":"Blelloch Guy E.","key":"e_1_3_2_1_3_1"},{"volume-title":"Can Seqlocks Get Along with Programming Language Memory Models? (MSPC '12)","author":"Boehm J.","key":"e_1_3_2_1_4_1"},{"volume-title":"Chakrabarti","year":"2016","author":"Boehm J.","key":"e_1_3_2_1_5_1"},{"volume-title":"Atlas: Leveraging Locks for Non-volatile Memory Consistency (OOPSLA '14)","year":"2014","author":"Chakrabarti Dhruva R.","key":"e_1_3_2_1_6_1"},{"volume-title":"Non-volatile Memories (ASPLOS XVI)","year":"1950","author":"Coburn Joel","key":"e_1_3_2_1_7_1"},{"volume-title":"Persistent Memory (SOSP '09)","year":"2009","author":"Condit Jeremy","key":"e_1_3_2_1_8_1"},{"volume-title":"Log-Free Concurrent Data Structures. In 2018 USENIX Annual Technical Conference (USENIX ATC 18)","year":"2018","author":"David Tudor","key":"e_1_3_2_1_9_1"},{"volume-title":"A Persistent Lock-free Queue for Non-volatile Memory (PPoPP '18)","author":"Friedman Michal","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2014.6844467"},{"volume-title":"Hennessy","year":"1991","author":"Gharachorloo Kourosh","key":"e_1_3_2_1_12_1"},{"volume-title":"Wenisch","year":"2018","author":"Gogte Vaibhav","key":"e_1_3_2_1_13_1"},{"volume-title":"Measuring the Impact of the Synchronization on Concurrent Algorithms (PPoPP","year":"2015","author":"Gramoli Vincent","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"volume-title":"The Art of Multiprocessor Programming","author":"Herlihy Maurice","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","unstructured":"Intel. 2015. Intel and Micron Produce Breakthrough Memory Technology . https:\/\/newsroom.intel.com\/news-releases\/intel-and-micron-produce-breakthrough-memory-technology\/.  Intel. 2015. Intel and Micron Produce Breakthrough Memory Technology . https:\/\/newsroom.intel.com\/news-releases\/intel-and-micron-produce-breakthrough-memory-technology\/."},{"volume-title":"DISC 2016, Paris, France, September 27--29, 2016. Proceedings. 313--327","author":"Izraelevitz Joseph","key":"e_1_3_2_1_18_1"},{"volume-title":"Zixuan Wang, Yi Xu, Subramanya R. Dulloor, Jishen Zhao, and Steven Swanson.","year":"2019","author":"Izraelevitz Joseph","key":"e_1_3_2_1_19_1"},{"volume-title":"Efficient Persist Barriers for Multicores (MICRO-48)","author":"Joshi Arpit","key":"e_1_3_2_1_20_1"},{"volume-title":"DHTM: Durable Hardware Transactional Memory (ISCA '18)","year":"2018","author":"Joshi Arpit","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/146628.139676"},{"volume-title":"Wenisch","year":"2017","author":"Kolli Aasheesh","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","first-page":"13","volume-title":"Wenisch","author":"Kolli Aasheesh","year":"2016"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2014.6974684"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065034"},{"volume-title":"High Performance Dynamic Lock-free Hash Tables and List-based Sets (SPAA '02)","year":"2002","author":"Michael Maged M.","key":"e_1_3_2_1_27_1"},{"volume-title":"Scott","year":"1996","author":"Michael Maged M.","key":"e_1_3_2_1_28_1"},{"volume-title":"An Analysis of Persistent Memory Use with WHISPER (ASPLOS '17)","year":"2017","author":"Nalli Sanketh","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Dushyanth Narayanan and Orion Hodson. 2012. Whole-system Persistence (ASPLOS XVII). ACM New York NY USA 401--410. https:\/\/doi.org\/10.1145\/2150976.2151018  Dushyanth Narayanan and Orion Hodson. 2012. Whole-system Persistence (ASPLOS XVII). ACM New York NY USA 401--410. https:\/\/doi.org\/10.1145\/2150976.2151018","DOI":"10.1145\/2248487.2151018"},{"volume-title":"Fast Concurrent Lock-free Binary Search Trees (PPoPP '14)","year":"2014","author":"Natarajan Aravind","key":"e_1_3_2_1_31_1"},{"key":"e_1_3_2_1_32_1","volume-title":"Dal\u00ed: A Periodically Persistent Hash Map. In 31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), , Andr\u00e9a W. Richa (Ed.)","volume":"91","author":"Nawab Faisal","year":"2017"},{"volume-title":"Wenisch","year":"2014","author":"Pelley Steven","key":"e_1_3_2_1_33_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276507"},{"volume-title":"ThyNVM: Enabling Software-Transparent Crash Consistency in Persistent Memory Systems (MICRO-48)","author":"Ren Jinglei","key":"e_1_3_2_1_35_1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Michael L. Scott. 2013. Shared-Memory Synchronization. Morgan & Claypool Publishers.  Michael L. Scott. 2013. Shared-Memory Synchronization. Morgan & Claypool Publishers.","DOI":"10.1007\/978-3-031-01740-7"},{"volume-title":"Hiding the Long Latency of Persist Barriers Using Speculative Execution (ISCA '17)","author":"Shin Seunghee","key":"e_1_3_2_1_37_1"},{"volume-title":"Campbell","year":"2011","author":"Venkataraman Shivaram","key":"e_1_3_2_1_38_1"},{"volume-title":"Andres Jaan Tack, and Michael M. Swift","year":"2011","author":"Volos Haris","key":"e_1_3_2_1_39_1"},{"volume-title":"Persistent Atomics for Implementing Durable Lock-Free Data Structures for Non-Volatile Memory (Brief Announcement) (SPAA '19)","author":"Wang William","key":"e_1_3_2_1_40_1"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Andrew Waterman Yunsup Lee David A. Patterson Krste Asanovic Volume I User level Isa Andrew Waterman Yunsup Lee and David Patterson. 2014. The RISC-V Instruction Set Manual.  Andrew Waterman Yunsup Lee David A. Patterson Krste Asanovic Volume I User level Isa Andrew Waterman Yunsup Lee and David Patterson. 2014. The RISC-V Instruction Set Manual.","DOI":"10.1109\/HOTCHIPS.2013.7478332"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3291057"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2016.19"}],"event":{"name":"ASPLOS '20: Architectural Support for Programming Languages and Operating Systems","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGOPS ACM Special Interest Group on Operating Systems","SIGARCH ACM Special Interest Group on Computer Architecture","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"Lausanne Switzerland","acronym":"ASPLOS '20"},"container-title":["Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373376.3378481","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373376.3378481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:59Z","timestamp":1750199579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373376.3378481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,9]]},"references-count":43,"alternative-id":["10.1145\/3373376.3378481","10.1145\/3373376"],"URL":"https:\/\/doi.org\/10.1145\/3373376.3378481","relation":{},"subject":[],"published":{"date-parts":[[2020,3,9]]},"assertion":[{"value":"2020-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}