{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:22Z","timestamp":1750220362713,"version":"3.41.0"},"reference-count":93,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006234","name":"Sandia National Laboratories","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006234","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["1914717 and 1740095"],"award-info":[{"award-number":["1914717 and 1740095"]}]},{"name":"National Technology and Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc."},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy's National Nuclear Security Administration","doi-asserted-by":"publisher","award":["DE-NA0003525"],"award-info":[{"award-number":["DE-NA0003525"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2021,6,30]]},"abstract":"<jats:p>Emerging byte-addressable Non-Volatile Memories (NVMs) enable persistent memory where process state can be recovered after crashes. To enable applications to rely on persistent data, durable data structures with failure-atomic operations have been proposed. However, they lack the ability to allow users to execute a sequence of operations as transactions. Meanwhile, persistent transactional memory (PTM) has been proposed by adding durability to Software Transactional Memory (STM). However, PTM suffers from high performance overheads and low scalability due to false aborts, logging, and ordering constraints on persistence.<\/jats:p>\n          <jats:p>In this article, we propose PETRA, a new approach for constructing persistent transactional linked data structures. PETRA natively supports transactions, but unlike PTM, relies on the high-level information from the data structure semantics. This gives PETRA unique advantages in the form of high performance and high scalability. Our experimental results using various benchmarks demonstrate the scalability of PETRA in all workloads and transaction sizes. PETRA outperforms the state-of-the-art PTMs by an order of magnitude in transactions of size greater than one, and demonstrates superior performance in transactions of size one.<\/jats:p>","DOI":"10.1145\/3446391","type":"journal-article","created":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T17:06:27Z","timestamp":1615223187000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["PETRA"],"prefix":"10.1145","volume":"18","author":[{"given":"Ramin","family":"Izadpanah","sequence":"first","affiliation":[{"name":"University of Central Florida, Orlando, FL, USA"}]},{"given":"Christina","family":"Peterson","sequence":"additional","affiliation":[{"name":"University of Central Florida, Orlando, FL, USA"}]},{"given":"Yan","family":"Solihin","sequence":"additional","affiliation":[{"name":"University of Central Florida, Orlando, FL, USA"}]},{"given":"Damian","family":"Dechev","sequence":"additional","affiliation":[{"name":"University of Central Florida, Orlando, FL, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"M. Alshboul J. Tuck and Y. Solihin. 2018. Lazy persistency: A high-performing and write-efficient software persistency technique. In ISCA. IEEE Washington DC 439--451. DOI:https:\/\/doi.org\/10.1109\/ISCA.2018.00044  M. Alshboul J. Tuck and Y. Solihin. 2018. Lazy persistency: A high-performing and write-efficient software persistency technique. In ISCA. IEEE Washington DC 439--451. DOI:https:\/\/doi.org\/10.1109\/ISCA.2018.00044","DOI":"10.1109\/ISCA.2018.00044"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025122"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Hillel Avni Eliezer Levy and Avi Mendelson. 2015. Hardware transactions in nonvolatile memory. In Distributed Computing Yoram Moses (Ed.). Springer Berlin 617--630.  Hillel Avni Eliezer Levy and Avi Mendelson. 2015. Hardware transactions in nonvolatile memory. In Distributed Computing Yoram Moses (Ed.). Springer Berlin 617--630.","DOI":"10.1007\/978-3-662-48653-5_41"},{"volume-title":"SPAA","author":"Barnes Greg","key":"e_1_2_1_4_1","unstructured":"Greg Barnes . 1993. A method for implementing lock-free shared-data structures . In SPAA . ACM , New York, NY , 261--270. DOI:https:\/\/doi.org\/10.1145\/165231.165265 Greg Barnes. 1993. A method for implementing lock-free shared-data structures. In SPAA. ACM, New York, NY, 261--270. DOI:https:\/\/doi.org\/10.1145\/165231.165265"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"H. A. Beadle W. Cai H. Wen and M. L. Scott. 2020. Nonblocking persistent software transactional memory. In PPoPP. ACM New York NY. DOI:https:\/\/doi.org\/10.1145\/3332466.3374506  H. A. Beadle W. Cai H. Wen and M. L. Scott. 2020. Nonblocking persistent software transactional memory. In PPoPP. ACM New York NY. DOI:https:\/\/doi.org\/10.1145\/3332466.3374506","DOI":"10.1109\/HiPC50609.2020.00042"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"C. Cascaval C. Blundell M. Michael H. W. Cain P. Wu S. Chiras and S. Chatterjee. 2008. Software transactional memory: Why is it only a research toy? Queue 6 5 (2008). DOI:https:\/\/doi.org\/10.1145\/1454456.1454466  C. Cascaval C. Blundell M. Michael H. W. Cain P. Wu S. Chiras and S. Chatterjee. 2008. Software transactional memory: Why is it only a research toy? Queue 6 5 (2008). DOI:https:\/\/doi.org\/10.1145\/1454456.1454466","DOI":"10.1145\/1454456.1454466"},{"key":"e_1_2_1_7_1","volume-title":"Atlas: Leveraging locks for non-volatile memory consistency. In OOPSLA. ACM. DOI:https:\/\/doi.org\/10.1145\/2660193.2660224","author":"Chakrabarti D. R.","year":"2014","unstructured":"D. R. Chakrabarti , H.-J. Boehm , and K. Bhandari . 2014 . Atlas: Leveraging locks for non-volatile memory consistency. In OOPSLA. ACM. DOI:https:\/\/doi.org\/10.1145\/2660193.2660224 D. R. Chakrabarti, H.-J. Boehm, and K. Bhandari. 2014. Atlas: Leveraging locks for non-volatile memory consistency. In OOPSLA. ACM. DOI:https:\/\/doi.org\/10.1145\/2660193.2660224"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"G. Chen L. Zhang R. Budhiraja X. Shen and Y. Wu. 2017. Efficient support of position independence on non-volatile memory. In MICRO. ACM 191--203. DOI:https:\/\/doi.org\/10.1145\/3123939.3124543  G. Chen L. Zhang R. Budhiraja X. Shen and Y. Wu. 2017. Efficient support of position independence on non-volatile memory. In MICRO. ACM 191--203. DOI:https:\/\/doi.org\/10.1145\/3123939.3124543","DOI":"10.1145\/3123939.3124543"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752947"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"P. Chuong F. Ellen and V. Ramachandran. 2010. A universal construction for wait-free transaction friendly data structures. In SPAA. ACM New York NY. DOI:https:\/\/doi.org\/10.1145\/1810479.1810538  P. Chuong F. Ellen and V. Ramachandran. 2010. A universal construction for wait-free transaction friendly data structures. In SPAA. ACM New York NY. DOI:https:\/\/doi.org\/10.1145\/1810479.1810538","DOI":"10.1145\/1810479.1810538"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"J. Coburn A. M. Caulfield A. Akel L. M. Grupp R. K. Gupta R. Jhala and S. Swanson. 2011. NV-Heaps: Making persistent objects fast and safe with next-generation non-volatile memories. In ASPLOS. ACM.  J. Coburn A. M. Caulfield A. Akel L. M. Grupp R. K. Gupta R. Jhala and S. Swanson. 2011. NV-Heaps: Making persistent objects fast and safe with next-generation non-volatile memories. In ASPLOS. ACM.","DOI":"10.1145\/1950365.1950380"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"N. Cohen D. T. Aksun H. Avni and J. R. Larus. 2019. Fine-grain checkpointing with in-cache-line logging. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3297858.3304046  N. Cohen D. T. Aksun H. Avni and J. R. Larus. 2019. Fine-grain checkpointing with in-cache-line logging. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3297858.3304046","DOI":"10.1145\/3297858.3304046"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"J. Condit E. B. Nightingale C. Frost E. Ipek B. Lee D. Burger and D. Coetzee. 2009. Better I\/O through byte-addressable persistent memory. In SOSP.  J. Condit E. B. Nightingale C. Frost E. Ipek B. Lee D. Burger and D. Coetzee. 2009. Better I\/O through byte-addressable persistent memory. In SOSP.","DOI":"10.1145\/1629575.1629589"},{"key":"e_1_2_1_14_1","volume-title":"Romulus: Efficient algorithms for persistent transactional memory. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/3210377.3210392","author":"Correia A.","year":"2018","unstructured":"A. Correia , P. Felber , and P. Ramalhete . 2018 . Romulus: Efficient algorithms for persistent transactional memory. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/3210377.3210392 A. Correia, P. Felber, and P. Ramalhete. 2018. Romulus: Efficient algorithms for persistent transactional memory. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/3210377.3210392"},{"key":"e_1_2_1_15_1","unstructured":"T. David A. Dragojevi\u0107 R. Guerraoui and I. Zablotchi. 2018. Log-free concurrent data structures. In USENIX ATC. USENIX. Retrieved from https:\/\/www.usenix.org\/conference\/atc18\/presentation\/david.  T. David A. Dragojevi\u0107 R. Guerraoui and I. Zablotchi. 2018. Log-free concurrent data structures. In USENIX ATC. USENIX. Retrieved from https:\/\/www.usenix.org\/conference\/atc18\/presentation\/david."},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"D. Dechev P. Pirkelbauer and B. Stroustrup. 2006. Lock-free dynamically resizable arrays. In Principles of Distributed Systems. Springer Berlin.  D. Dechev P. Pirkelbauer and B. Stroustrup. 2006. Lock-free dynamically resizable arrays. In Principles of Distributed Systems. Springer Berlin.","DOI":"10.1007\/11945529_11"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"D. Dice O. Shalev and N. Shavit. 2006. Transactional locking II. In Distributed Computing. Springer Berlin.  D. Dice O. Shalev and N. Shavit. 2006. Transactional locking II. In Distributed Computing. Springer Berlin.","DOI":"10.1007\/11864219_14"},{"key":"e_1_2_1_18_1","volume-title":"TLRW: Return of the read-write lock. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/1810479.1810531","author":"Dice D.","year":"2010","unstructured":"D. Dice and N. Shavit . 2010 . TLRW: Return of the read-write lock. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/1810479.1810531 D. Dice and N. Shavit. 2010. TLRW: Return of the read-write lock. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/1810479.1810531"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"S. R. Dulloor S. Kumar A. Keshavamurthy P. Lantz D. Reddy R. Sankaran and J. Jackson. 2014. System software for persistent memory. In CS.  S. R. Dulloor S. Kumar A. Keshavamurthy P. Lantz D. Reddy R. Sankaran and J. Jackson. 2014. System software for persistent memory. In CS.","DOI":"10.1145\/2592798.2592814"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"F. Ellen P. Fatourou J. Helga and E. Ruppert. 2014. The amortized complexity of non-blocking binary search trees. In PODC. ACM. DOI:https:\/\/doi.org\/10.1145\/2611462.2611486  F. Ellen P. Fatourou J. Helga and E. Ruppert. 2014. The amortized complexity of non-blocking binary search trees. In PODC. ACM. DOI:https:\/\/doi.org\/10.1145\/2611462.2611486","DOI":"10.1145\/2611462.2611486"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"H. Elnawawy M. Alshboul J. Tuck and Y. Solihin. 2017. Efficient checkpointing of loop-based codes for non-volatile main memory. IEEE. DOI:https:\/\/doi.org\/10.1109\/PACT.2017.58  H. Elnawawy M. Alshboul J. Tuck and Y. Solihin. 2017. Efficient checkpointing of loop-based codes for non-volatile main memory. IEEE. DOI:https:\/\/doi.org\/10.1109\/PACT.2017.58","DOI":"10.1109\/PACT.2017.58"},{"key":"e_1_2_1_22_1","first-page":"1","article-title":"Parameterized leaf power recognition via embedding into graph products. In IPEC, Vol. 115. LIPIcs, Dagstuhl","volume":"16","author":"Eppstein David","year":"2019","unstructured":"David Eppstein and Elham Havvaei . 2019 . Parameterized leaf power recognition via embedding into graph products. In IPEC, Vol. 115. LIPIcs, Dagstuhl , Germany , 16 : 1 -- 16 :14. DOI:https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2018.16 David Eppstein and Elham Havvaei. 2019. Parameterized leaf power recognition via embedding into graph products. In IPEC, Vol. 115. LIPIcs, Dagstuhl, Germany, 16:1--16:14. DOI:https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2018.16","journal-title":"Germany"},{"key":"e_1_2_1_23_1","unstructured":"Facebook. 2020. A Persistent Key-Value Store for Flash and RAM Storage. Retrieved from https:\/\/github.com\/facebook\/rocksdb.  Facebook. 2020. A Persistent Key-Value Store for Flash and RAM Storage. Retrieved from https:\/\/github.com\/facebook\/rocksdb."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"P. Fatourou and N. D. Kallimanis. 2011. A highly efficient wait-free universal construction. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/1989493.1989549  P. Fatourou and N. D. Kallimanis. 2011. A highly efficient wait-free universal construction. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/1989493.1989549","DOI":"10.1145\/1989493.1989549"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"P. Felber C. Fetzer and T. Riegel. 2008. Dynamic performance tuning of word-based software transactional memory. In PPoPP. ACM. DOI:https:\/\/doi.org\/10.1145\/1345206.1345241  P. Felber C. Fetzer and T. Riegel. 2008. Dynamic performance tuning of word-based software transactional memory. In PPoPP. ACM. DOI:https:\/\/doi.org\/10.1145\/1345206.1345241","DOI":"10.1145\/1345206.1345241"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2417887"},{"volume-title":"Technical Report UCAM-CL-TR-579","author":"Fraser Keir","key":"e_1_2_1_27_1","unstructured":"Keir Fraser . 2004. Practical Lock-freedom. Technical Report UCAM-CL-TR-579 . University of Cambridge , Computer Laboratory . Retrieved from https:\/\/www.cl.cam.ac.uk\/techreports\/UCAM-CL-TR-579.pdf. Keir Fraser. 2004. Practical Lock-freedom. Technical Report UCAM-CL-TR-579. University of Cambridge, Computer Laboratory. Retrieved from https:\/\/www.cl.cam.ac.uk\/techreports\/UCAM-CL-TR-579.pdf."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233307.1233309"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178490"},{"key":"e_1_2_1_30_1","unstructured":"Google. 2020. LevelDB: A Fast Key-value Storage Library. Retrieved from https:\/\/github.com\/google\/leveldb.  Google. 2020. LevelDB: A Fast Key-value Storage Library. Retrieved from https:\/\/github.com\/google\/leveldb."},{"volume-title":"Cloud computing and big data analytics: What is new from databases perspective? In BDA","author":"Gupta Rajeev","key":"e_1_2_1_31_1","unstructured":"Rajeev Gupta , Himanshu Gupta , and Mukesh Mohania . 2012. Cloud computing and big data analytics: What is new from databases perspective? In BDA . Springer , 42--61. Rajeev Gupta, Himanshu Gupta, and Mukesh Mohania. 2012. Cloud computing and big data analytics: What is new from databases perspective? In BDA. Springer, 42--61."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/289.291"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Timothy L. Harris. 2001. A pragmatic implementation of non-blocking linked-lists. In Distributed Computing Jennifer Welch (Ed.). Springer Berlin 300--314.  Timothy L. Harris. 2001. A pragmatic implementation of non-blocking linked-lists. In Distributed Computing Jennifer Welch (Ed.). Springer Berlin 300--314.","DOI":"10.1007\/3-540-45414-4_21"},{"key":"e_1_2_1_34_1","volume-title":"Pratt","author":"Harris Timothy L.","year":"2002","unstructured":"Timothy L. Harris , Keir Fraser , and Ian A . Pratt . 2002 . A practical multi-word compare-and-swap operation. In Distributed Computing, Dahlia Malkhi (Ed.). Springer Berlin , 265--279. Timothy L. Harris, Keir Fraser, and Ian A. Pratt. 2002. A practical multi-word compare-and-swap operation. In Distributed Computing, Dahlia Malkhi (Ed.). Springer Berlin, 265--279."},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"D. Hendler N. Shavit and L. Yerushalmi. 2004. A scalable lock-free stack algorithm. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/1007912.1007944  D. Hendler N. Shavit and L. Yerushalmi. 2004. A scalable lock-free stack algorithm. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/1007912.1007944","DOI":"10.1145\/1007912.1007944"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/161468.161469"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"M. Herlihy and E. Koskinen. 2008. Transactional boosting: A methodology for highly-concurrent transactional objects. In PPoPP. ACM. DOI:https:\/\/doi.org\/10.1145\/1345206.1345237  M. Herlihy and E. Koskinen. 2008. Transactional boosting: A methodology for highly-concurrent transactional objects. In PPoPP. ACM. DOI:https:\/\/doi.org\/10.1145\/1345206.1345237","DOI":"10.1145\/1345206.1345237"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"M. Herlihy and J. E. B. Moss. 1993. Transactional memory: architectural support for lock-free data structures. In ISCA. ACM. DOI:https:\/\/doi.org\/10.1145\/165123.165164  M. Herlihy and J. E. B. Moss. 1993. Transactional memory: architectural support for lock-free data structures. In ISCA. ACM. DOI:https:\/\/doi.org\/10.1145\/165123.165164","DOI":"10.1145\/165123.165164"},{"key":"e_1_2_1_40_1","unstructured":"M. Herlihy and N. Shavit. 2008. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc.  M. Herlihy and N. Shavit. 2008. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc."},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"N. Herman J. P. Inala Y. Huang L. Tsai E. Kohler B. Liskov and L. Shrira. 2016. Type-aware transactions for faster concurrent code. In ECCS. ACM 31.  N. Herman J. P. Inala Y. Huang L. Tsai E. Kohler B. Liskov and L. Shrira. 2016. Type-aware transactions for faster concurrent code. In ECCS. ACM 31.","DOI":"10.1145\/2901318.2901348"},{"key":"e_1_2_1_42_1","unstructured":"Intel. 2020. Persistent Memory Programming. Retrieved from http:\/\/pmem.io.  Intel. 2020. Persistent Memory Programming. Retrieved from http:\/\/pmem.io."},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"J. Izraelevitz T. Kelly and A. Kolli. 2016. Failure-atomic persistent memory updates via JUSTDO logging. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/2872362.2872410  J. Izraelevitz T. Kelly and A. Kolli. 2016. Failure-atomic persistent memory updates via JUSTDO logging. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/2872362.2872410","DOI":"10.1145\/2872362.2872410"},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","unstructured":"J. Izraelevitz H. Mendes and M. L. Scott. 2016. Linearizability of persistent memory objects under a full-system-crash failure model. In Distributed Computing. Springer Berlin 313--327.  J. Izraelevitz H. Mendes and M. L. Scott. 2016. Linearizability of persistent memory objects under a full-system-crash failure model. In Distributed Computing. Springer Berlin 313--327.","DOI":"10.1007\/978-3-662-53426-7_23"},{"key":"e_1_2_1_45_1","volume-title":"J. Kim, X. Liu, A. Memaripour, Y. J. Soh, Z. Wang, Y. Xu, S. R. Dulloor, J. Zhao, and S. Swanson.","author":"Izraelevitz J.","year":"2019","unstructured":"J. Izraelevitz , J. Yang , L. u Zhang , J. Kim, X. Liu, A. Memaripour, Y. J. Soh, Z. Wang, Y. Xu, S. R. Dulloor, J. Zhao, and S. Swanson. 2019 . Basic Performance Measurements of the Intel Optane DC Persistent Memory Module . arxiv:cs.DC\/1903.05714 (2019). J. Izraelevitz, J. Yang, L. u Zhang, J. Kim, X. Liu, A. Memaripour, Y. J. Soh, Z. Wang, Y. Xu, S. R. Dulloor, J. Zhao, and S. Swanson. 2019. Basic Performance Measurements of the Intel Optane DC Persistent Memory Module. arxiv:cs.DC\/1903.05714 (2019)."},{"key":"e_1_2_1_46_1","volume-title":"ATOM: Atomic durability in non-volatile memory through hardware logging","author":"Joshi A.","year":"2017","unstructured":"A. Joshi , V. Nagarajan , S. Viglas , and M. Cintra . 2017 . ATOM: Atomic durability in non-volatile memory through hardware logging . IEEE. DOI :https:\/\/doi.org\/10.1109\/HPCA.2017.50 A. Joshi, V. Nagarajan, S. Viglas, and M. Cintra. 2017. ATOM: Atomic durability in non-volatile memory through hardware logging. IEEE. DOI:https:\/\/doi.org\/10.1109\/HPCA.2017.50"},{"key":"e_1_2_1_47_1","volume-title":"OPODIS","volume":"46","author":"Kallimanis N. D.","year":"2015","unstructured":"N. D. Kallimanis and E. Kanellou . 2016. Wait-free concurrent graph objects with dynamic traversals . In OPODIS , Vol. 46 . DOI:https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS. 2015 .27 N. D. Kallimanis and E. Kanellou. 2016. Wait-free concurrent graph objects with dynamic traversals. In OPODIS, Vol. 46. DOI:https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2015.27"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3358955.3358957"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"R. M. Krishnan J. Kim A. Mathew X. Fu A. Demeri C. Min and S. Kannan. 2020. Durable transactional memory can scale with timestone. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3373376.3378483  R. M. Krishnan J. Kim A. Mathew X. Fu A. Demeri C. Min and S. Kannan. 2020. Durable transactional memory can scale with timestone. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3373376.3378483","DOI":"10.1145\/3373376.3378483"},{"key":"e_1_2_1_50_1","doi-asserted-by":"crossref","unstructured":"P. LaBorde L. Lebanoff C. Peterson D. Zhang and D. Dechev. 2019. Wait-free dynamic transactions for linked data structures. In PMAM. ACM. DOI:https:\/\/doi.org\/10.1145\/3303084.3309491  P. LaBorde L. Lebanoff C. Peterson D. Zhang and D. Dechev. 2019. Wait-free dynamic transactions for linked data structures. In PMAM. ACM. DOI:https:\/\/doi.org\/10.1145\/3303084.3309491","DOI":"10.1145\/3303084.3309491"},{"key":"e_1_2_1_51_1","doi-asserted-by":"crossref","unstructured":"K. Lamar C. Peterson and D. Dechev. 2020. Lock-free transactional vector. In PMAM. ACM.  K. Lamar C. Peterson and D. Dechev. 2020. Lock-free transactional vector. In PMAM. ACM.","DOI":"10.1145\/3380536.3380543"},{"key":"e_1_2_1_52_1","volume-title":"WORT: Write optimal radix tree for persistent memory storage systems. In FAST.","author":"Lee S. K.","year":"2017","unstructured":"S. K. Lee , K. H. Lim , H. Song , B. Nam , and S. H. Noh . 2017 . WORT: Write optimal radix tree for persistent memory storage systems. In FAST. Retrieved from https:\/\/www.usenix.org\/conference\/fast17\/technical-sessions\/presentation\/lee-se-kwon. S. K. Lee, K. H. Lim, H. Song, B. Nam, and S. H. Noh. 2017. WORT: Write optimal radix tree for persistent memory storage systems. In FAST. Retrieved from https:\/\/www.usenix.org\/conference\/fast17\/technical-sessions\/presentation\/lee-se-kwon."},{"key":"e_1_2_1_53_1","volume-title":"Recipe: Converting concurrent DRAM indexes to persistent-memory indexes. In SOSP. ACM. DOI:https:\/\/doi.org\/10.1145\/3341301.3359635","author":"Lee S. K.","year":"2019","unstructured":"S. K. Lee , J. Mohan , S. Kashyap , T. Kim , and V. Chidambaram . 2019 . Recipe: Converting concurrent DRAM indexes to persistent-memory indexes. In SOSP. ACM. DOI:https:\/\/doi.org\/10.1145\/3341301.3359635 S. K. Lee, J. Mohan, S. Kashyap, T. Kim, and V. Chidambaram. 2019. Recipe: Converting concurrent DRAM indexes to persistent-memory indexes. In SOSP. ACM. DOI:https:\/\/doi.org\/10.1145\/3341301.3359635"},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","unstructured":"M. Liu M. Zhang K. Chen X. Qian Y. Wu W. Zheng and J. Ren. 2017. DudeTM: Building durable transactions with decoupling for persistent memory. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3037697.3037714  M. Liu M. Zhang K. Chen X. Qian Y. Wu W. Zheng and J. Ren. 2017. DudeTM: Building durable transactions with decoupling for persistent memory. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3037697.3037714","DOI":"10.1145\/3037697.3037714"},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Q. Liu J. Izraelevitz S. K. Lee M. L. Scott S. H. Noh and C. Jung. 2018. iDO: Compiler-directed failure atomicity for nonvolatile memory. In MICRO. IEEE. DOI:https:\/\/doi.org\/10.1109\/MICRO.2018.00029  Q. Liu J. Izraelevitz S. K. Lee M. L. Scott S. H. Noh and C. Jung. 2018. iDO: Compiler-directed failure atomicity for nonvolatile memory. In MICRO. IEEE. DOI:https:\/\/doi.org\/10.1109\/MICRO.2018.00029","DOI":"10.1109\/MICRO.2018.00029"},{"key":"e_1_2_1_57_1","volume-title":"Persistent Memory Transactions. arxiv:cs.DC\/1804.00701","author":"Marathe Virendra","year":"2018","unstructured":"Virendra Marathe , Achin Mishra , Amee Trivedi , Yihe Huang , Faisal Zaghloul , Sanidhya Kashyap , Margo Seltzer , Tim Harris , Steve Byan , Bill Bridge , and Dave Dice . 2018. Persistent Memory Transactions. arxiv:cs.DC\/1804.00701 ( 2018 ). Virendra Marathe, Achin Mishra, Amee Trivedi, Yihe Huang, Faisal Zaghloul, Sanidhya Kashyap, Margo Seltzer, Tim Harris, Steve Byan, Bill Bridge, and Dave Dice. 2018. Persistent Memory Transactions. arxiv:cs.DC\/1804.00701 (2018)."},{"key":"e_1_2_1_58_1","doi-asserted-by":"crossref","unstructured":"A. Memaripour A. Badam A. Phanishayee Y. Zhou R. Alagappan K. Strauss and S. Swanson. 2017. Atomic in-place updates for non-volatile main memories with Kamino-Tx. In EuroSys. ACM. DOI:https:\/\/doi.org\/10.1145\/3064176.3064215  A. Memaripour A. Badam A. Phanishayee Y. Zhou R. Alagappan K. Strauss and S. Swanson. 2017. Atomic in-place updates for non-volatile main memories with Kamino-Tx. In EuroSys. ACM. DOI:https:\/\/doi.org\/10.1145\/3064176.3064215","DOI":"10.1145\/3064176.3064215"},{"key":"e_1_2_1_59_1","volume-title":"Pronto: Easy and fast persistence for volatile data structures. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3373376.3378456","author":"Memaripour A.","year":"2020","unstructured":"A. Memaripour , J. Izraelevitz , and S. Swanson . 2020 . Pronto: Easy and fast persistence for volatile data structures. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3373376.3378456 A. Memaripour, J. Izraelevitz, and S. Swanson. 2020. Pronto: Easy and fast persistence for volatile data structures. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3373376.3378456"},{"key":"e_1_2_1_60_1","volume-title":"Breeze: User-level access to non-volatile main memories for legacy software. In ICCD. 413--422.","author":"Memaripour A.","year":"2018","unstructured":"A. Memaripour and S. Swanson . 2018 . Breeze: User-level access to non-volatile main memories for legacy software. In ICCD. 413--422. A. Memaripour and S. Swanson. 2018. Breeze: User-level access to non-volatile main memories for legacy software. In ICCD. 413--422."},{"key":"e_1_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Barzan Mozafari Jags Ramnarayan Sudhir Menon Yogesh Mahajan Soubhik Chakraborty Hemant Bhanawat and Kishor Bachhav. 2017. SnappyData: A unified cluster for streaming transactions and interactice analytics. In CIDR.  Barzan Mozafari Jags Ramnarayan Sudhir Menon Yogesh Mahajan Soubhik Chakraborty Hemant Bhanawat and Kishor Bachhav. 2017. SnappyData: A unified cluster for streaming transactions and interactice analytics. In CIDR.","DOI":"10.1145\/2882903.2899408"},{"key":"e_1_2_1_62_1","unstructured":"MySQL. 2020. MySQL. Retrieved from https:\/\/www.mysql.com\/.  MySQL. 2020. MySQL. Retrieved from https:\/\/www.mysql.com\/."},{"key":"e_1_2_1_63_1","doi-asserted-by":"crossref","unstructured":"S. Nalli S. Haria M. D. Hill M. M. Swift H. Volos and K. Keeton. 2017. An analysis of persistent memory use with WHISPER. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3037697.3037730  S. Nalli S. Haria M. D. Hill M. M. Swift H. Volos and K. Keeton. 2017. An analysis of persistent memory use with WHISPER. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3037697.3037730","DOI":"10.1145\/3037697.3037730"},{"key":"e_1_2_1_64_1","first-page":"1","article-title":"Dal\u00ed: A periodically persistent hash map","volume":"91","author":"Nawab F.","year":"2017","unstructured":"F. Nawab , J. Izraelevitz , T. Kelly , C. B. Morrey III, D. R. Chakrabarti , and M. L. Scott . 2017 . Dal\u00ed: A periodically persistent hash map . In DISC , Vol. 91. 37: 1 -- 37 :16. DOI:https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.37 F. Nawab, J. Izraelevitz, T. Kelly, C. B. Morrey III, D. R. Chakrabarti, and M. L. Scott. 2017. Dal\u00ed: A periodically persistent hash map. In DISC, Vol. 91. 37:1--37:16. DOI:https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.37","journal-title":"DISC"},{"key":"e_1_2_1_65_1","doi-asserted-by":"crossref","unstructured":"I. Oukid J. Lasperas A. Nica T. Willhalm and W. Lehner. 2016. FPTree: A hybrid SCM-DRAM persistent and concurrent B-Tree for storage class memory. In SIGMOD. ACM. DOI:https:\/\/doi.org\/10.1145\/2882903.2915251  I. Oukid J. Lasperas A. Nica T. Willhalm and W. Lehner. 2016. FPTree: A hybrid SCM-DRAM persistent and concurrent B-Tree for storage class memory. In SIGMOD. ACM. DOI:https:\/\/doi.org\/10.1145\/2882903.2915251","DOI":"10.1145\/2882903.2915251"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"volume-title":"PMDK: Persistent Memory Development Kit.","year":"2020","key":"e_1_2_1_67_1","unstructured":"pmem team. 2020 . PMDK: Persistent Memory Development Kit. Retrieved from https:\/\/github.com\/pmem\/pmdk\/. pmem team. 2020. PMDK: Persistent Memory Development Kit. Retrieved from https:\/\/github.com\/pmem\/pmdk\/."},{"key":"e_1_2_1_68_1","unstructured":"pmem team. 2020. pmemkv: Key\/Value Datastore for Persistent Memory. Retrieved from https:\/\/github.com\/pmem\/pmemkv.  pmem team. 2020. pmemkv: Key\/Value Datastore for Persistent Memory. Retrieved from https:\/\/github.com\/pmem\/pmemkv."},{"volume-title":"Pmemkv-tools: Optional Tools and Utilities for Pmemkv.","year":"2020","key":"e_1_2_1_69_1","unstructured":"pmem team. 2020 . Pmemkv-tools: Optional Tools and Utilities for Pmemkv. Retrieved from https:\/\/github.com\/pmem\/pmemkv-tools. pmem team. 2020. Pmemkv-tools: Optional Tools and Utilities for Pmemkv. Retrieved from https:\/\/github.com\/pmem\/pmemkv-tools."},{"key":"e_1_2_1_70_1","doi-asserted-by":"crossref","unstructured":"P. Ramalhete A. Correia P. Felber and N. Cohen. 2019. OneFile: A wait-free persistent transactional memory. In DSN. IEEE 151--163. DOI:https:\/\/doi.org\/10.1109\/DSN.2019.00028  P. Ramalhete A. Correia P. Felber and N. Cohen. 2019. OneFile: A wait-free persistent transactional memory. In DSN. IEEE 151--163. DOI:https:\/\/doi.org\/10.1109\/DSN.2019.00028","DOI":"10.1109\/DSN.2019.00028"},{"key":"e_1_2_1_71_1","doi-asserted-by":"crossref","unstructured":"D. Schwalb M. Dreseler M. Uflacker and H. Plattner. 2015. NVC-hashmap: A persistent and concurrent hashmap for non-volatile memories. In IMDM. ACM. DOI:https:\/\/doi.org\/10.1145\/2803140.2803144  D. Schwalb M. Dreseler M. Uflacker and H. Plattner. 2015. NVC-hashmap: A persistent and concurrent hashmap for non-volatile memories. In IMDM. ACM. DOI:https:\/\/doi.org\/10.1145\/2803140.2803144","DOI":"10.1145\/2803140.2803144"},{"key":"e_1_2_1_72_1","doi-asserted-by":"crossref","unstructured":"O. Shacham N. Bronson A. Aiken M. Sagiv M. Vechev and E. Yahav. 2011. Testing atomicity of composed concurrent operations. In OOPSLA. ACM. DOI:https:\/\/doi.org\/10.1145\/2048066.2048073  O. Shacham N. Bronson A. Aiken M. Sagiv M. Vechev and E. Yahav. 2011. Testing atomicity of composed concurrent operations. In OOPSLA. ACM. DOI:https:\/\/doi.org\/10.1145\/2048066.2048073","DOI":"10.1145\/2048066.2048073"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"},{"key":"e_1_2_1_74_1","volume-title":"Proteus: A flexible and fast software supported hardware logging approach for NVM","author":"Shin S.","year":"2017","unstructured":"S. Shin , S. K. Tirukkovalluri , J. Tuck , and Y. Solihin . 2017 . Proteus: A flexible and fast software supported hardware logging approach for NVM . In MICRO. IEEE. S. Shin, S. K. Tirukkovalluri, J. Tuck, and Y. Solihin. 2017. Proteus: A flexible and fast software supported hardware logging approach for NVM. In MICRO. IEEE."},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"M. F. Spear L. Dalessandro V. J. Marathe and M. L. Scott. 2009. A comprehensive strategy for contention management in software transactional memory. SIGPLAN Not. 44 4 (2009). DOI:https:\/\/doi.org\/10.1145\/1594835.1504199  M. F. Spear L. Dalessandro V. J. Marathe and M. L. Scott. 2009. A comprehensive strategy for contention management in software transactional memory. SIGPLAN Not. 44 4 (2009). DOI:https:\/\/doi.org\/10.1145\/1594835.1504199","DOI":"10.1145\/1594835.1504199"},{"key":"e_1_2_1_76_1","doi-asserted-by":"crossref","unstructured":"A. Spiegelman G. Golan-Gueta and I. Keidar. 2016. Transactional data structure libraries. In PLDI. ACM. DOI:https:\/\/doi.org\/10.1145\/2908080.2908112  A. Spiegelman G. Golan-Gueta and I. Keidar. 2016. Transactional data structure libraries. In PLDI. ACM. DOI:https:\/\/doi.org\/10.1145\/2908080.2908112","DOI":"10.1145\/2908080.2908112"},{"volume-title":"Open Source Database Systems: Systems Study, Performance and Scalability","author":"\u00a0al T. Strandell","key":"e_1_2_1_77_1","unstructured":"T. Strandell et \u00a0al . 2010. Open Source Database Systems: Systems Study, Performance and Scalability . VDM Publishing . T. Strandell et\u00a0al. 2010. Open Source Database Systems: Systems Study, Performance and Scalability. VDM Publishing."},{"key":"e_1_2_1_78_1","unstructured":"S. Venkataraman N. Tolia P. Ranganathan and R. H. Campbell. 2011. Consistent and durable data structures for non-volatile byte-addressable memory. In FAST. USENIX. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id&equals;1960475.1960480.  S. Venkataraman N. Tolia P. Ranganathan and R. H. Campbell. 2011. Consistent and durable data structures for non-volatile byte-addressable memory. In FAST. USENIX. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id&equals;1960475.1960480."},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592810"},{"key":"e_1_2_1_80_1","first-page":"4","article-title":"Mnemosyne: Lightweight persistent memory","volume":"47","author":"Volos Haris","year":"2011","unstructured":"Haris Volos , Andres Jaan Tack , and Michael M. Swift . 2011 . Mnemosyne: Lightweight persistent memory . SIGPLAN Not. 47 , 4 (Mar. 2011), 91--104. DOI:https:\/\/doi.org\/10.1145\/2248487.1950379 Haris Volos, Andres Jaan Tack, and Michael M. Swift. 2011. Mnemosyne: Lightweight persistent memory. SIGPLAN Not. 47, 4 (Mar. 2011), 91--104. DOI:https:\/\/doi.org\/10.1145\/2248487.1950379","journal-title":"SIGPLAN Not."},{"key":"e_1_2_1_81_1","doi-asserted-by":"crossref","unstructured":"T. Wang J. Levandoski and P. Larson. 2018. Easy lock-free indexing in non-volatile memory. In ICDE. IEEE. DOI:https:\/\/doi.org\/10.1109\/ICDE.2018.00049  T. Wang J. Levandoski and P. Larson. 2018. Easy lock-free indexing in non-volatile memory. In ICDE. IEEE. DOI:https:\/\/doi.org\/10.1109\/ICDE.2018.00049","DOI":"10.1109\/ICDE.2018.00049"},{"key":"e_1_2_1_82_1","doi-asserted-by":"crossref","unstructured":"T. Wang S. Simbasivam Y. Solihin and J. Tuck. 2017. Hardware supported persistent object translation. In MICRO.  T. Wang S. Simbasivam Y. Solihin and J. Tuck. 2017. Hardware supported persistent object translation. In MICRO.","DOI":"10.1145\/3123939.3123981"},{"volume-title":"Checkpointing and its applications","author":"Wang Yi-Min","key":"e_1_2_1_83_1","unstructured":"Yi-Min Wang , Yennun Huang , Kiem-Phong Vo , Pe-Yu Chung , and Chandra Kintala . 1995. Checkpointing and its applications . In FTCS. IEEE , 22--31. Yi-Min Wang, Yennun Huang, Kiem-Phong Vo, Pe-Yu Chung, and Chandra Kintala. 1995. Checkpointing and its applications. In FTCS. IEEE, 22--31."},{"key":"e_1_2_1_84_1","volume-title":"NOVA: A log-structured file system for hybrid volatile\/non-volatile main memories. In FAST. USENIX.","author":"Swanson Jian","year":"2016","unstructured":"Jian X. and S. Swanson . 2016 . NOVA: A log-structured file system for hybrid volatile\/non-volatile main memories. In FAST. USENIX. Retrieved from https:\/\/www.usenix.org\/conference\/fast16\/technical-sessions\/presentation\/xu. Jian X. and S. Swanson. 2016. NOVA: A log-structured file system for hybrid volatile\/non-volatile main memories. In FAST. USENIX. Retrieved from https:\/\/www.usenix.org\/conference\/fast16\/technical-sessions\/presentation\/xu."},{"key":"e_1_2_1_85_1","doi-asserted-by":"crossref","unstructured":"J. Xu L. Zhang A. Memaripour A. Gangadharaiah A. Borase T. B. Da Silva S. Swanson and A. Rudoff. 2017. NOVA-Fortis: A fault-tolerant non-volatile main memory file system. In SOSP\u201917.  J. Xu L. Zhang A. Memaripour A. Gangadharaiah A. Borase T. B. Da Silva S. Swanson and A. Rudoff. 2017. NOVA-Fortis: A fault-tolerant non-volatile main memory file system. In SOSP\u201917.","DOI":"10.1145\/3132747.3132761"},{"key":"e_1_2_1_86_1","volume-title":"Yongqing Zhu, and Khai Leong Yong.","author":"Xu Quanqing","year":"2018","unstructured":"Quanqing Xu , Khin Mi Mi Aung , Yongqing Zhu, and Khai Leong Yong. 2018 . A blockchain-based storage system for data analytics in the internet of things. In New Advances in the Internet of Things. Springer , 119--138. Quanqing Xu, Khin Mi Mi Aung, Yongqing Zhu, and Khai Leong Yong. 2018. A blockchain-based storage system for data analytics in the internet of things. In New Advances in the Internet of Things. Springer, 119--138."},{"key":"e_1_2_1_87_1","volume-title":"MERR: Improving security of persistent memory objects via efficient memory exposure reduction and randomization. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3373376.3378492","author":"Xu Y.","year":"2020","unstructured":"Y. Xu , Y. Solihin , and X. Shen . 2020 . MERR: Improving security of persistent memory objects via efficient memory exposure reduction and randomization. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3373376.3378492 Y. Xu, Y. Solihin, and X. Shen. 2020. MERR: Improving security of persistent memory objects via efficient memory exposure reduction and randomization. In ASPLOS. ACM. DOI:https:\/\/doi.org\/10.1145\/3373376.3378492"},{"key":"e_1_2_1_88_1","unstructured":"J. Yang Q. Wei C. Chen C. Wang K. L. Yong and B. He. 2015. NV-Tree: Reducing consistency cost for NVM-based single level systems. In FAST.  J. Yang Q. Wei C. Chen C. Wang K. L. Yong and B. He. 2015. NV-Tree: Reducing consistency cost for NVM-based single level systems. In FAST."},{"key":"e_1_2_1_89_1","doi-asserted-by":"crossref","unstructured":"P. Zardoshti T. Zhou Y. Liu and M. Spear. 2019. Optimizing persistent memory transactions. In PACT. IEEE.  P. Zardoshti T. Zhou Y. Liu and M. Spear. 2019. Optimizing persistent memory transactions. In PACT. IEEE.","DOI":"10.1109\/PACT.2019.00025"},{"key":"e_1_2_1_90_1","doi-asserted-by":"crossref","unstructured":"D. Zhang and D. Dechev. 2016. An efficient lock-free logarithmic search data structure based on multi-dimensional list. In ICDCS. IEEE. DOI:https:\/\/doi.org\/10.1109\/ICDCS.2016.19  D. Zhang and D. Dechev. 2016. An efficient lock-free logarithmic search data structure based on multi-dimensional list. In ICDCS. IEEE. DOI:https:\/\/doi.org\/10.1109\/ICDCS.2016.19","DOI":"10.1109\/ICDCS.2016.19"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2419651"},{"key":"e_1_2_1_92_1","doi-asserted-by":"crossref","unstructured":"D. Zhang and D. Dechev. 2016. Lock-free transactions without rollbacks for linked data structures. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/2935764.2935780  D. Zhang and D. Dechev. 2016. Lock-free transactions without rollbacks for linked data structures. In SPAA. ACM. DOI:https:\/\/doi.org\/10.1145\/2935764.2935780","DOI":"10.1145\/2935764.2935780"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209690"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360554"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446391","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3446391","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3446391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:27Z","timestamp":1750191447000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446391"}},"subtitle":["Persistent Transactional Non-blocking Linked Data Structures"],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":93,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6,30]]}},"alternative-id":["10.1145\/3446391"],"URL":"https:\/\/doi.org\/10.1145\/3446391","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2021,3,8]]},"assertion":[{"value":"2020-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}