{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:09Z","timestamp":1750220349596,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSERC","award":["1-855-275-2861"],"award-info":[{"award-number":["1-855-275-2861"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461820","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"423-425","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["PHPRX: An Efficient Hash Table for Persistent Memory"],"prefix":"10.1145","author":[{"given":"Diego","family":"Cepeda","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Golab","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"volume-title":"Proc. of the 25th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'20)","author":"Memaripour A.","key":"e_1_3_2_1_1_1","unstructured":"A. Memaripour , J. Izraelevitz , and S. Swanson . 2020. Pronto: Easy and Fast Persistence for Volatile Data Structures . In Proc. of the 25th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'20) . 789--806. A. Memaripour, J. Izraelevitz, and S. Swanson. 2020. Pronto: Easy and Fast Persistence for Volatile Data Structures. In Proc. of the 25th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'20). 789--806."},{"key":"e_1_3_2_1_2_1","first-page":"8","article-title":"2020. Dash","volume":"13","author":"Lu B.","year":"2020","unstructured":"B. Lu , X. Hao , T. Wang , and E. Lo . 2020. Dash : Scalable Hashing on Persistent Memory. Proc. VLDB Endow. 13 , 8 ( 2020 ), 1147--1161. B. Lu, X. Hao, T. Wang, and E. Lo. 2020. Dash: Scalable Hashing on Persistent Memory. Proc. VLDB Endow. 13, 8 (2020), 1147--1161.","journal-title":"Scalable Hashing on Persistent Memory. Proc. VLDB Endow."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/3323298.3323302"},{"volume-title":"Proc. of the 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI'19)","author":"Zuo P.","key":"e_1_3_2_1_4_1","unstructured":"P. Zuo , Y. Hua , and J. Wu . 2018. Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory . In Proc. of the 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI'19) . 461--476. P. Zuo, Y. Hua, and J. Wu. 2018. Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory. In Proc. of the 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI'19). 461--476."},{"volume-title":"Proc. of the 27th ACM Symposium on Operating Systems Principles (SOSP'19)","author":"Lee S. K.","key":"e_1_3_2_1_5_1","unstructured":"S. K. Lee , J. Mohan , S. Kashyap , T. Kim , and V. Chidambaram . 2019. RECIPE: Converting Concurrent DRAM Indexes to Persistent-Memory Indexes . In Proc. of the 27th ACM Symposium on Operating Systems Principles (SOSP'19) . 462--477. S. K. Lee, J. Mohan, S. Kashyap, T. Kim, and V. Chidambaram. 2019. RECIPE: Converting Concurrent DRAM Indexes to Persistent-Memory Indexes. In Proc. of the 27th ACM Symposium on Operating Systems Principles (SOSP'19). 462--477."},{"volume-title":"Proc. of the 20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'15)","author":"David T.","key":"e_1_3_2_1_6_1","unstructured":"T. David , R. Guerraoui , and V. Trigonakis . 2015. Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures . In Proc. of the 20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'15) . 631--664. T. David, R. Guerraoui, and V. Trigonakis. 2015. Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures. In Proc. of the 20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'15). 631--664."},{"key":"e_1_3_2_1_7_1","unstructured":"T. David R. Guerraoui T. Che and V. Trigonakis. 2014. Designing ASCY-compliant Concurrent Search Data Structures. (2014). Technical Report https:\/\/infoscience.epfl.ch\/record\/203822.  T. David R. Guerraoui T. Che and V. Trigonakis. 2014. Designing ASCY-compliant Concurrent Search Data Structures. (2014). Technical Report https:\/\/infoscience.epfl.ch\/record\/203822."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.07.035"}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","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"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":8,"alternative-id":["10.1145\/3409964.3461820","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461820","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}