{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:53:43Z","timestamp":1752983623867,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["CRDPJ 539431-19, DGECR-2019-00048, RGPIN-2019-04227"],"award-info":[{"award-number":["CRDPJ 539431-19, DGECR-2019-00048, RGPIN-2019-04227"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000196","name":"Canada Foundation for Innovation","doi-asserted-by":"publisher","award":["38512"],"award-info":[{"award-number":["38512"]}],"id":[{"id":"10.13039\/501100000196","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538568","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"217-229","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["PREP-UC"],"prefix":"10.1145","author":[{"given":"Gaetano C.","family":"Coccimiglio","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"Trevor A.","family":"Brown","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3022671.2984019"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025122"},{"volume-title":"Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time","author":"Brown Trevor","key":"e_1_3_2_1_3_1","unstructured":"Trevor Brown , Aleksandar Prokopec , and Dan Alistarh . 2020. Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time . Association for Computing Machinery , New York, NY, USA , 276--291. https:\/\/doi.org\/10.1145\/3332466.3374542 10.1145\/3332466.3374542 Trevor Brown, Aleksandar Prokopec, and Dan Alistarh. 2020. Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time .Association for Computing Machinery, New York, NY, USA, 276--291. https:\/\/doi.org\/10.1145\/3332466.3374542"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093336.3037721"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950380"},{"volume-title":"Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems","author":"Cohen Nachshon","key":"e_1_3_2_1_6_1","unstructured":"Nachshon Cohen , David T. Aksun , Hillel Avni , and James R. Larus . 2019. Fine-Grain Checkpointing with In-Cache-Line Logging . In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems ( Providence, RI, USA) (ASPLOS '19). Association for Computing Machinery, New York, NY, USA, 441--454. https:\/\/doi.org\/10.1145\/3297858.3304046 10.1145\/3297858.3304046 Nachshon Cohen, David T. Aksun, Hillel Avni, and James R. Larus. 2019. Fine-Grain Checkpointing with In-Cache-Line Logging. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (Providence, RI, USA) (ASPLOS '19). Association for Computing Machinery, New York, NY, USA, 441--454. https:\/\/doi.org\/10.1145\/3297858.3304046"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210400"},{"volume-title":"Intel 64 and IA-32 Architectures Software Developer's Manual","author":"Intel Corporation","key":"e_1_3_2_1_8_1","unstructured":"Intel Corporation . 2016. Intel 64 and IA-32 Architectures Software Developer's Manual Volume 3A: System Programming Guide, Part 1 . Available at: intel.com\/content\/www\/us\/en\/architecture-and-technology\/64-ia-32-architectures-software-developer-vol-3a-part-1-manual.html . , 286 pages. Intel Corporation. 2016. Intel 64 and IA-32 Architectures Software Developer's Manual Volume 3A: System Programming Guide, Part 1. Available at: intel.com\/content\/www\/us\/en\/architecture-and-technology\/64-ia-32-architectures-software-developer-vol-3a-part-1-manual.html . , 286 pages."},{"key":"e_1_3_2_1_9_1","unstructured":"Intel Corporation. 2017. Intel Optane Persistent Memory. Available at: https:\/\/www.intel.com\/content\/www\/us\/en\/architecture-and-technology\/optane-dc-persistent-memory .  Intel Corporation. 2017. Intel Optane Persistent Memory. Available at: https:\/\/www.intel.com\/content\/www\/us\/en\/architecture-and-technology\/optane-dc-persistent-memory ."},{"key":"e_1_3_2_1_10_1","unstructured":"Intel Corporation. 2018. Persistent Memory Development Kit. https:\/\/pmem.io\/pmdk\/.  Intel Corporation. 2018. Persistent Memory Development Kit. https:\/\/pmem.io\/pmdk\/."},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387515"},{"volume-title":"2020 b. A Wait-Free Universal Construction for Large Objects","author":"Correia Andreia","key":"e_1_3_2_1_13_1","unstructured":"Andreia Correia , Pedro Ramalhete , and Pascal Felber . 2020 b. A Wait-Free Universal Construction for Large Objects . Association for Computing Machinery , New York, NY, USA , 102--116. https:\/\/doi.org\/10.1145\/3332466.3374523 10.1145\/3332466.3374523 Andreia Correia, Pedro Ramalhete, and Pascal Felber. 2020 b. A Wait-Free Universal Construction for Large Objects .Association for Computing Machinery, New York, NY, USA, 102--116. https:\/\/doi.org\/10.1145\/3332466.3374523"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 2018 USENIX Conference on Usenix Annual Technical Conference (Boston, MA, USA) (USENIX ATC '18). USENIX Association, USA, 373--385","author":"David Tudor","year":"2018","unstructured":"Tudor David , Aleksandar Dragojevi\u00e7 , Rachid Guerraoui , and Igor Zablotchi . 2018 . Log-Free Concurrent Data Structures . In Proceedings of the 2018 USENIX Conference on Usenix Annual Technical Conference (Boston, MA, USA) (USENIX ATC '18). USENIX Association, USA, 373--385 . Tudor David, Aleksandar Dragojevi\u00e7, Rachid Guerraoui, and Igor Zablotchi. 2018. Log-Free Concurrent Data Structures. In Proceedings of the 2018 USENIX Conference on Usenix Annual Technical Conference (Boston, MA, USA) (USENIX ATC '18). USENIX Association, USA, 373--385."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3423211.3425671"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures","author":"Fatourou Panagiota","year":"1989","unstructured":"Panagiota Fatourou and Nikolaos D. Kallimanis . 2011. A Highly-Efficient Wait-Free Universal Construction . In Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures ( San Jose, California, USA) (SPAA '11). Association for Computing Machinery, New York, NY, USA, 325--334. https:\/\/doi.org\/10.1145\/ 1989 493.1989549 10.1145\/1989493.1989549 Panagiota Fatourou and Nikolaos D. Kallimanis. 2011. A Highly-Efficient Wait-Free Universal Construction. In Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures (San Jose, California, USA) (SPAA '11). Association for Computing Machinery, New York, NY, USA, 325--334. https:\/\/doi.org\/10.1145\/1989493.1989549"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-020-00370-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386031"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178490"},{"key":"e_1_3_2_1_20_1","volume-title":"Mirror: Making Lock-Free Data Structures Persistent","author":"Friedman Michal","year":"2021","unstructured":"Michal Friedman , Erez Petrank , and Pedro Ramalhete . 2021 . Mirror: Making Lock-Free Data Structures Persistent . Association for Computing Machinery , New York, NY, USA , 1218--1232. https:\/\/doi.org\/10.1145\/3453483.3454105 10.1145\/3453483.3454105 Michal Friedman, Erez Petrank, and Pedro Ramalhete. 2021. Mirror: Making Lock-Free Data Structures Persistent .Association for Computing Machinery, New York, NY, USA, 1218--1232. https:\/\/doi.org\/10.1145\/3453483.3454105"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_23_1","volume-title":"The art of multiprocessor programming","author":"Herlihy Maurice","unstructured":"Maurice Herlihy and Nir Shavit . 2008. The art of multiprocessor programming 1 st ed.). Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. I--XX, 1--508 pages. Maurice Herlihy and Nir Shavit. 2008. The art of multiprocessor programming 1st ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. I--XX, 1--508 pages.","edition":"1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/62546.62593"},{"volume-title":"Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","author":"Herlihy M. P.","key":"e_1_3_2_1_25_1","unstructured":"M. P. Herlihy and J. M. Wing . 1987. Axioms for Concurrent Objects . In Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages ( Munich, West Germany) (POPL '87). Association for Computing Machinery, New York, NY, USA, 13--26. https:\/\/doi.org\/10.1145\/41625.41627 10.1145\/41625.41627 M. P. Herlihy and J. M. Wing. 1987. Axioms for Concurrent Objects. In Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (Munich, West Germany) (POPL '87). Association for Computing Machinery, New York, NY, USA, 13--26. https:\/\/doi.org\/10.1145\/41625.41627"},{"volume-title":"DISC 2016, Paris, France, September 27--29, 2016. Proceedings. Springer Berlin Heidelberg","author":"Izraelevitz Joseph","key":"e_1_3_2_1_26_1","unstructured":"Joseph Izraelevitz , Hammurabi Mendes , and Michael L. Scott . 2016. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. In Distributed Computing - 30th International Symposium , DISC 2016, Paris, France, September 27--29, 2016. Proceedings. Springer Berlin Heidelberg , Berlin, Heidelberg, 313--327. https:\/\/doi.org\/10.1007\/978--3--662--53426--7_23 10.1007\/978--3--662--53426--7_23 Joseph Izraelevitz, Hammurabi Mendes, and Michael L. Scott. 2016. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. In Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27--29, 2016. Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg, 313--327. https:\/\/doi.org\/10.1007\/978--3--662--53426--7_23"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00045"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093336.3037714"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378456"},{"key":"e_1_3_2_1_30_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)","volume":"16","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 International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 91), , Andr\u00e9a W. Richa (Ed.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 37:1--37: 16 . https:\/\/doi.org\/10.4230\/LIPIcs.DISC. 2017 .37 10.4230\/LIPIcs.DISC.2017.37 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 International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 91), , Andr\u00e9a W. Richa (Ed.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 37:1--37:16. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.37"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950379"},{"key":"e_1_3_2_1_32_1","article-title":"Nap","volume":"18","author":"Wang Qing","year":"2022","unstructured":"Qing Wang , Youyou Lu , Junru Li , Minhui Xie , and Jiwu Shu . 2022 . Nap : Persistent Memory Indexes for NUMA Architectures. ACM Trans. Storage , Vol. 18 , 1, Article 2 (jan 2022), 35 pages. https:\/\/doi.org\/10.1145\/3507922 10.1145\/3507922 Qing Wang, Youyou Lu, Junru Li, Minhui Xie, and Jiwu Shu. 2022. Nap: Persistent Memory Indexes for NUMA Architectures. ACM Trans. Storage , Vol. 18, 1, Article 2 (jan 2022), 35 pages. https:\/\/doi.org\/10.1145\/3507922","journal-title":"Persistent Memory Indexes for NUMA Architectures. ACM Trans. Storage"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00049"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508436"},{"key":"e_1_3_2_1_35_1","volume-title":"Montage: A general system for buffered durably linearizable data structures. arXiv preprint arXiv:2009.13701","author":"Wen Haosen","year":"2020","unstructured":"Haosen Wen , Wentao Cai , Mingzhe Du , Louis Jenkins , Benjamin Valpey , and Michael L Scott . 2020 . Montage: A general system for buffered durably linearizable data structures. arXiv preprint arXiv:2009.13701 (2020). Haosen Wen, Wentao Cai, Mingzhe Du, Louis Jenkins, Benjamin Valpey, and Michael L Scott. 2020. Montage: A general system for buffered durably linearizable data structures. arXiv preprint arXiv:2009.13701 (2020)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360554"}],"event":{"name":"SPAA '22: 34th 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":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538568","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538568"}},"subtitle":["A Practical Replicated Persistent Universal Construction"],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":36,"alternative-id":["10.1145\/3490148.3538568","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538568","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}