{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:45:05Z","timestamp":1773193505259,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Department of Energy Computational Science Graduate Fellowship","award":["DE-SC0020347"],"award-info":[{"award-number":["DE-SC0020347"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-1955498, CCF-1717712, and CNS-1900803"],"award-info":[{"award-number":["CNS-1955498, CCF-1717712, and CNS-1900803"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Google Faculty Research award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3472456.3472458","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:46:04Z","timestamp":1633459564000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["A Fast, General System for Buffered Persistent Data Structures"],"prefix":"10.1145","author":[{"given":"Haosen","family":"Wen","sequence":"first","affiliation":[{"name":"University of Rochester, United States of America"}]},{"given":"Wentao","family":"Cai","sequence":"additional","affiliation":[{"name":"University of Rochester, United States of America"}]},{"given":"Mingzhe","family":"Du","sequence":"additional","affiliation":[{"name":"University of Rochester, United States of America"}]},{"given":"Louis","family":"Jenkins","sequence":"additional","affiliation":[{"name":"University of Rochester, United States of America"}]},{"given":"Benjamin","family":"Valpey","sequence":"additional","affiliation":[{"name":"University of Rochester, United States of America"}]},{"given":"Michael L.","family":"Scott","sequence":"additional","affiliation":[{"name":"University of Rochester, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"12th Non-Volatile Memories Wkshp.","author":"Aksun David","unstructured":"David Aksun and James Larus . 2021. Durability Through NVM Checkpointing (poster) . In 12th Non-Volatile Memories Wkshp. David Aksun and James Larus. 2021. Durability Through NVM Checkpointing (poster). In 12th Non-Volatile Memories Wkshp."},{"key":"e_1_3_2_1_2_1","volume-title":"Nonblocking Persistent Software Transactional Memory. In 27th Intl. Conf. on High Performance Computing, Data, and Analytics (HiPC).","author":"Beadle Alan","year":"2020","unstructured":"H.\u00a0 Alan Beadle , Wentao Cai , Haosen Wen , and Michael\u00a0 L. Scott . 2020 . Nonblocking Persistent Software Transactional Memory. In 27th Intl. Conf. on High Performance Computing, Data, and Analytics (HiPC). H.\u00a0Alan Beadle, Wentao Cai, Haosen Wen, and Michael\u00a0L. Scott. 2020. Nonblocking Persistent Software Transactional Memory. In 27th Intl. Conf. on High Performance Computing, Data, and Analytics (HiPC)."},{"key":"e_1_3_2_1_3_1","volume-title":"Understanding and Optimizing Persistent Memory Allocation. In 19th Intl. Symp. on Memory Management (ISMM).","author":"Cai W.","year":"2020","unstructured":"W. Cai , H. Wen , H.\u00a0 A. Beadle , C. Kjellqvist , M. Hedayati , and M.\u00a0 L. Scott . 2020 . Understanding and Optimizing Persistent Memory Allocation. In 19th Intl. Symp. on Memory Management (ISMM). W. Cai, H. Wen, H.\u00a0A. Beadle, C. Kjellqvist, M. Hedayati, and M.\u00a0L. Scott. 2020. Understanding and Optimizing Persistent Memory Allocation. In 19th Intl. Symp. on Memory Management (ISMM)."},{"key":"e_1_3_2_1_4_1","volume-title":"Atlas: Leveraging Locks for Non-volatile Memory Consistency. In ACM Conf. on Object Oriented Programming Systems Languages & Applications (OOPSLA).","author":"Chakrabarti R.","year":"2014","unstructured":"Dhruva\u00a0 R. Chakrabarti , Hans- J. Boehm , and Kumud Bhandari . 2014 . Atlas: Leveraging Locks for Non-volatile Memory Consistency. In ACM Conf. on Object Oriented Programming Systems Languages & Applications (OOPSLA). Dhruva\u00a0R. Chakrabarti, Hans-J. Boehm, and Kumud Bhandari. 2014. Atlas: Leveraging Locks for Non-volatile Memory Consistency. In ACM Conf. on Object Oriented Programming Systems Languages & Applications (OOPSLA)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735483"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752947"},{"key":"e_1_3_2_1_7_1","volume-title":"Non-volatile Memories. In 16th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). 14\u00a0pages. https:\/\/doi.org\/10","author":"Coburn Joel","year":"2011","unstructured":"Joel Coburn , Adrian\u00a0 M. Caulfield , Ameen Akel , Laura\u00a0 M. Grupp , Rajesh\u00a0 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). 14\u00a0pages. https:\/\/doi.org\/10 .1145\/1950365.1950380 Joel Coburn, Adrian\u00a0M. Caulfield, Ameen Akel, Laura\u00a0M. Grupp, Rajesh\u00a0K. 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). 14\u00a0pages. https:\/\/doi.org\/10.1145\/1950365.1950380"},{"key":"e_1_3_2_1_8_1","volume-title":"Fine-Grain Checkpointing with In-Cache-Line Logging. In 24th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). 14\u00a0pages. https:\/\/doi.org\/10","author":"Cohen Nachshon","year":"2019","unstructured":"Nachshon Cohen , David\u00a0 T. Aksun , Hillel Avni , and James\u00a0 R. Larus . 2019 . Fine-Grain Checkpointing with In-Cache-Line Logging. In 24th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). 14\u00a0pages. https:\/\/doi.org\/10 .1145\/3297858.3304046 Nachshon Cohen, David\u00a0T. Aksun, Hillel Avni, and James\u00a0R. Larus. 2019. Fine-Grain Checkpointing with In-Cache-Line Logging. In 24th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). 14\u00a0pages. https:\/\/doi.org\/10.1145\/3297858.3304046"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276523"},{"key":"e_1_3_2_1_10_1","unstructured":"Brian Cooper. 2010. YCSB Core Workloads. https:\/\/github.com\/brianfrankcooper\/YCSB\/wiki\/Core-Workloads.  Brian Cooper. 2010. YCSB Core Workloads. https:\/\/github.com\/brianfrankcooper\/YCSB\/wiki\/Core-Workloads."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210392"},{"key":"e_1_3_2_1_12_1","volume-title":"Log-Free Concurrent Data Structures. In Usenix Annual Technical Conf. (ATC). https:\/\/www.usenix.org\/conference\/atc18\/presentation\/david","author":"David Tudor","year":"2018","unstructured":"Tudor David , Aleksandar Dragojevi\u0107 , Rachid Guerraoui , and Igor Zablotchi . 2018 . Log-Free Concurrent Data Structures. In Usenix Annual Technical Conf. (ATC). https:\/\/www.usenix.org\/conference\/atc18\/presentation\/david Tudor David, Aleksandar Dragojevi\u0107, Rachid Guerraoui, and Igor Zablotchi. 2018. Log-Free Concurrent Data Structures. In Usenix Annual Technical Conf. (ATC). https:\/\/www.usenix.org\/conference\/atc18\/presentation\/david"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386031"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178490"},{"key":"e_1_3_2_1_15_1","volume-title":"SoftWrAP: A Lightweight Framework for Transactional Support of Storage Class Memory. In 31st Symp. on Mass Storage Systems and Technologies (MSST).","author":"Giles R.","year":"2015","unstructured":"Ellis\u00a0 R. Giles , Kshitij Doshi , and Peter Varman . 2015 . SoftWrAP: A Lightweight Framework for Transactional Support of Storage Class Memory. In 31st Symp. on Mass Storage Systems and Technologies (MSST). Ellis\u00a0R. Giles, Kshitij Doshi, and Peter Varman. 2015. SoftWrAP: A Lightweight Framework for Transactional Support of Storage Class Memory. In 31st Symp. on Mass Storage Systems and Technologies (MSST)."},{"key":"e_1_3_2_1_16_1","volume-title":"Pisces: A Scalable and Efficient Persistent Transactional Memory. In Usenix Annual Technical Conf. (ATC).","author":"Gu Jinyu","year":"2019","unstructured":"Jinyu Gu , Qianqian Yu , Xiayang Wang , Zhaoguo Wang , Binyu Zang , Haibing Guan , and Haibo Chen . 2019 . Pisces: A Scalable and Efficient Persistent Transactional Memory. In Usenix Annual Technical Conf. (ATC). Jinyu Gu, Qianqian Yu, Xiayang Wang, Zhaoguo Wang, Binyu Zang, Haibing Guan, and Haibo Chen. 2019. Pisces: A Scalable and Efficient Persistent Transactional Memory. In Usenix Annual Technical Conf. (ATC)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378472"},{"key":"e_1_3_2_1_18_1","volume-title":"12th European Conf. on Computer Systems (EuroSys).","author":"Ching-Hsiang Hsu Terry","year":"2017","unstructured":"Terry Ching-Hsiang Hsu , Helge Br\u00fcgner , Indrajit Roy , Kimberly Keeton , and Patrick Eugster . 2017 . NVthreads: Practical persistence for multi-threaded applications . In 12th European Conf. on Computer Systems (EuroSys). Terry Ching-Hsiang Hsu, Helge Br\u00fcgner, Indrajit Roy, Kimberly Keeton, and Patrick Eugster. 2017. NVthreads: Practical persistence for multi-threaded applications. In 12th European Conf. on Computer Systems (EuroSys)."},{"key":"e_1_3_2_1_19_1","volume-title":"16th Usenix Conf. on File and Storage Technologies (FAST).","author":"Hwang Deukyeon","year":"2018","unstructured":"Deukyeon Hwang , Wook-Hee Kim , Youjip Won , and Beomseok Nam . 2018 . Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree . In 16th Usenix Conf. on File and Storage Technologies (FAST). Deukyeon Hwang, Wook-Hee Kim, Youjip Won, and Beomseok Nam. 2018. Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree. In 16th Usenix Conf. on File and Storage Technologies (FAST)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872410"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_23"},{"key":"e_1_3_2_1_22_1","unstructured":"Joseph Izraelevitz Jian Yang Lu Zhang Juno Kim Xiao Liu Amirsaman Memaripour Yun\u00a0Joon Soh Zixuan Wang Yi Xu Subramanya\u00a0R. Dulloor Jishen Zhao and Steven Swanson. 2019. Basic Performance Measurements of the Intel Optane DC Persistent Memory Module. arXiv:1903.05714v3.  Joseph Izraelevitz Jian Yang Lu Zhang Juno Kim Xiao Liu Amirsaman Memaripour Yun\u00a0Joon Soh Zixuan Wang Yi Xu Subramanya\u00a0R. Dulloor Jishen Zhao and Steven Swanson. 2019. Basic Performance Measurements of the Intel Optane DC Persistent Memory Module. arXiv:1903.05714v3."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404397.3404443"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378483"},{"key":"e_1_3_2_1_25_1","volume-title":"16th Intl. Symp. on Distributed Computing (DISC).","author":"Harris\u00a0Timothy","unstructured":"Harris\u00a0Timothy L., Fraser Keir , and Pratt\u00a0Ian A.2002. A Practical Multi-word Compare-and-Swap Operation . In 16th Intl. Symp. on Distributed Computing (DISC). Harris\u00a0Timothy L., Fraser Keir, and Pratt\u00a0Ian A.2002. A Practical Multi-word Compare-and-Swap Operation. In 16th Intl. Symp. on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_26_1","volume-title":"WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems. In 15th Usenix Conf. on File and Storage Technologies (FAST).","author":"Lee Se\u00a0Kwon","year":"2017","unstructured":"Se\u00a0Kwon Lee , K.\u00a0 Hyun Lim , Hyunsub Song , Beomseok Nam , and Sam\u00a0 H. Noh . 2017 . WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems. In 15th Usenix Conf. on File and Storage Technologies (FAST). Se\u00a0Kwon Lee, K.\u00a0Hyun Lim, Hyunsub Song, Beomseok Nam, and Sam\u00a0H. Noh. 2017. WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems. In 15th Usenix Conf. on File and Storage Technologies (FAST)."},{"key":"e_1_3_2_1_27_1","volume-title":"LRMalloc: A Modern and Competitive Lock-Free Dynamic Memory Allocator. In 13th Intl. Meeting on High Performance Computing for Computational Science (VECPAR).","author":"Leite Ricardo","year":"2018","unstructured":"Ricardo Leite and Ricardo Rocha . 2018 . LRMalloc: A Modern and Competitive Lock-Free Dynamic Memory Allocator. In 13th Intl. Meeting on High Performance Computing for Computational Science (VECPAR). Ricardo Leite and Ricardo Rocha. 2018. LRMalloc: A Modern and Competitive Lock-Free Dynamic Memory Allocator. In 13th Intl. Meeting on High Performance Computing for Computational Science (VECPAR)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00029"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.39"},{"key":"e_1_3_2_1_31_1","unstructured":"Pratyush Mahapatra Mark\u00a0D Hill and Michael\u00a0M Swift. 2019. Don\u2019t Persist All: Efficient Persistent Data Structures. arXiv:1905.13011.  Pratyush Mahapatra Mark\u00a0D Hill and Michael\u00a0M Swift. 2019. Don\u2019t Persist All: Efficient Persistent Data Structures. arXiv:1905.13011."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378456"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2018.00069"},{"key":"e_1_3_2_1_34_1","first-page":"3","article-title":"B3-tree: Byte-Addressable Binary B-Tree for Persistent Memory","volume":"16","author":"Nam Moohyeon","year":"2020","unstructured":"Moohyeon Nam , Hokeun Cha , Kibeom Jin , Jiwon Seo , and Beomseok Nam . 2020 . B3-tree: Byte-Addressable Binary B-Tree for Persistent Memory . ACM Trans. on Storage 16 , 3 (July 2020). Moohyeon Nam, Hokeun Cha, Kibeom Jin, Jiwon Seo, and Beomseok Nam. 2020. B3-tree: Byte-Addressable Binary B-Tree for Persistent Memory. ACM Trans. on Storage 16, 3 (July 2020).","journal-title":"ACM Trans. on Storage"},{"key":"e_1_3_2_1_35_1","volume-title":"Dal\u00ed: A Periodically Persistent Hash Map. In Intl. Symp. on Distributed Computing (DISC).","author":"Nawab Faisal","year":"2017","unstructured":"Faisal Nawab , Joseph Izraelevitz , Terence Kelly , Charles B.\u00a0Morrey III, Dhruva\u00a0 R. Chakrabarti , and Michael\u00a0 L. Scott . 2017 . Dal\u00ed: A Periodically Persistent Hash Map. In Intl. Symp. on Distributed Computing (DISC). Faisal Nawab, Joseph Izraelevitz, Terence Kelly, Charles B.\u00a0Morrey III, Dhruva\u00a0R. Chakrabarti, and Michael\u00a0L. Scott. 2017. Dal\u00ed: A Periodically Persistent Hash Map. In Intl. Symp. on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915251"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212783"},{"key":"e_1_3_2_1_38_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). 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)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_20"},{"key":"e_1_3_2_1_40_1","unstructured":"Steve Scargall. 2018. Using Persistent Memory Devices with the Linux Device Mapper. https:\/\/pmem.io\/2018\/05\/15\/using_persistent_memory_devices_with_the_linux_device_mapper.html.  Steve Scargall. 2018. Using Persistent Memory Devices with the Linux Device Mapper. https:\/\/pmem.io\/2018\/05\/15\/using_persistent_memory_devices_with_the_linux_device_mapper.html."},{"key":"e_1_3_2_1_41_1","volume-title":"3rd VLDB Wkshp. on In-Memory Data Management and Analytics (IMDM).","author":"Schwalb David","unstructured":"David Schwalb , Markus Dreseler , Matthias Uflacker , and Hasso Plattner . 2015. NVC-Hashmap: A Persistent and Concurrent Hashmap For Non-Volatile Memories . In 3rd VLDB Wkshp. on In-Memory Data Management and Analytics (IMDM). David Schwalb, Markus Dreseler, Matthias Uflacker, and Hasso Plattner. 2015. NVC-Hashmap: A Persistent and Concurrent Hashmap For Non-Volatile Memories. In 3rd VLDB Wkshp. on In-Memory Data Management and Analytics (IMDM)."},{"key":"e_1_3_2_1_42_1","unstructured":"Usharani U. and Andy\u00a0M. Rudoff. 2017. Introduction to Programming with Persistent Memory from Intel. https:\/\/software.intel.com\/en-us\/articles\/introduction-to-programming-with-persistent-memory-from-intel.  Usharani U. and Andy\u00a0M. Rudoff. 2017. Introduction to Programming with Persistent Memory from Intel. https:\/\/software.intel.com\/en-us\/articles\/introduction-to-programming-with-persistent-memory-from-intel."},{"key":"e_1_3_2_1_43_1","volume-title":"Consistent and Durable Data Structures for Non-volatile Byte-addressable Memory. In 9th Usenix Conf. on File and Storage Technologies (FAST).","author":"Venkataraman Shivaram","year":"2011","unstructured":"Shivaram Venkataraman , Niraj Tolia , Parthasarathy Ranganathan , and Roy\u00a0 H. Campbell . 2011 . Consistent and Durable Data Structures for Non-volatile Byte-addressable Memory. In 9th Usenix Conf. on File and Storage Technologies (FAST). Shivaram Venkataraman, Niraj Tolia, Parthasarathy Ranganathan, and Roy\u00a0H. Campbell. 2011. Consistent and Durable Data Structures for Non-volatile Byte-addressable Memory. In 9th Usenix Conf. on File and Storage Technologies (FAST)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950379"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177915"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386000"},{"key":"e_1_3_2_1_47_1","volume-title":"Re-execute More. In 26th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS).","author":"Xu Yi","year":"2021","unstructured":"Yi Xu , Joseph Izraelevitz , and Steven Swanson . 2021 . Clobber-NVM: Log Less , Re-execute More. In 26th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). Yi Xu, Joseph Izraelevitz, and Steven Swanson. 2021. Clobber-NVM: Log Less, Re-execute More. In 26th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS)."},{"key":"e_1_3_2_1_48_1","unstructured":"Jaewon Yang and Jure Leskovec. 2012. SNAP Dataset: Orkut Social Network and Ground-Truth Communities. https:\/\/snap.stanford.edu\/data\/com-Orkut.html.  Jaewon Yang and Jure Leskovec. 2012. SNAP Dataset: Orkut Social Network and Ground-Truth Communities. https:\/\/snap.stanford.edu\/data\/com-Orkut.html."},{"key":"e_1_3_2_1_49_1","volume-title":"NV-Tree: Reducing Consistency Cost for NVM-based Single Level Systems. In 13th Usenix Conf. on File and Storage Technologies (FAST).","author":"Yang Jun","year":"2015","unstructured":"Jun Yang , Qingsong Wei , Cheng Chen , Chundong Wang , Khai\u00a0Leong Yong , and Bingsheng He . 2015 . NV-Tree: Reducing Consistency Cost for NVM-based Single Level Systems. In 13th Usenix Conf. on File and Storage Technologies (FAST). Jun Yang, Qingsong Wei, Cheng Chen, Chundong Wang, Khai\u00a0Leong Yong, and Bingsheng He. 2015. NV-Tree: Reducing Consistency Cost for NVM-based Single Level Systems. In 13th Usenix Conf. on File and Storage Technologies (FAST)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360554"}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","location":"Lemont IL USA","acronym":"ICPP 2021"},"container-title":["50th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472458","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3472458","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3472458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:11Z","timestamp":1750193291000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":50,"alternative-id":["10.1145\/3472456.3472458","10.1145\/3472456"],"URL":"https:\/\/doi.org\/10.1145\/3472456.3472458","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}