{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:13:27Z","timestamp":1740100407720,"version":"3.37.3"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006227","name":"Lawrence Livermore National Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006227","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8,18]]},"DOI":"10.1109\/nvmsa53655.2021.9628805","type":"proceedings-article","created":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T21:09:10Z","timestamp":1638824950000},"page":"1-7","source":"Crossref","is-referenced-by-count":2,"title":["PMap: A Non-volatile Lock-free Hash Map with Open Addressing"],"prefix":"10.1109","author":[{"given":"Kenneth","family":"Lamar","sequence":"first","affiliation":[]},{"given":"Christina","family":"Peterson","sequence":"additional","affiliation":[]},{"given":"Damian","family":"Dechev","sequence":"additional","affiliation":[]},{"given":"Roger","family":"Pearce","sequence":"additional","affiliation":[]},{"given":"Keita","family":"Iwabuchi","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Pirkelbauer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.23919\/DATE48585.2020.9116223"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389134"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00029"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950379"},{"key":"ref35","article-title":"Lock-free hopscotch hashing","author":"kelly","year":"2019","journal-title":"arXiv preprint arXiv 1911 12945"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2014.70"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178490"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00028"},{"journal-title":"pmem io persistent memory programming","year":"2014","author":"corporation","key":"ref12"},{"key":"ref13","first-page":"298","article-title":"Intel® threading building blocks","volume":"23","author":"pheatt","year":"2008","journal-title":"J Comput Sci Coll"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/11561927_10","article-title":"Non-blocking hashtables with open addressing","author":"purcell","year":"2005","journal-title":"International Symposium on Distributed Computing"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.01.004"},{"key":"ref17","article-title":"Efficient almost wait-free parallel accessible dynamic hashtables","author":"gao","year":"2003","journal-title":"Technical Report CS-Report 03-03"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-004-0115-2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592820"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378456"},{"key":"ref4","article-title":"A lock-free wait-free hash table","author":"click","year":"0","journal-title":"Work Presented As Invited Speaker at Stanford"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3322096"},{"key":"ref3","first-page":"799","article-title":"Lock-free concurrent level hashing for persistent memory","author":"chen","year":"2020","journal-title":"2020 USENIX Annual Technical Conference (USENIX ATC)"},{"key":"ref6","first-page":"373","article-title":"Log-free concurrent data structures","author":"david","year":"2018","journal-title":"2018 USENIX Annual Technical Conference (USENIX ATC 18)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2883591.2883597"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00049"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935810"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-015-0376-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916243"},{"journal-title":"The Art of Multiprocessor Programming","year":"2008","author":"herlihy","key":"ref9"},{"key":"ref1","article-title":"Persistent memory evaluation and experiments","author":"pearce","year":"2019","journal-title":"Persistent Programming In Real Life (PIRL) 2019"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612687"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210408"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147958"},{"key":"ref24","article-title":"Per-bucket concurrent rehashing algorithms","author":"malakhov","year":"2015","journal-title":"arXiv preprint arXiv 1509 02235"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3309206"},{"key":"ref26","first-page":"461","article-title":"Write-optimized and high-performance hashing index scheme for persistent memory","author":"zuo","year":"2018","journal-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)"},{"key":"ref25","article-title":"Dal´?: A periodically persistent hash map","author":"nawab","year":"2017","journal-title":"31st International Symposium on Distributed Computing (DISC 2017)"}],"event":{"name":"2021 IEEE 10th Non-Volatile Memory Systems and Applications Symposium (NVMSA)","start":{"date-parts":[[2021,8,18]]},"location":"Beijing, China","end":{"date-parts":[[2021,8,20]]}},"container-title":["2021 IEEE 10th Non-Volatile Memory Systems and Applications Symposium (NVMSA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9628140\/9628406\/09628805.pdf?arnumber=9628805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:53:51Z","timestamp":1652201631000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9628805\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,18]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/nvmsa53655.2021.9628805","relation":{},"subject":[],"published":{"date-parts":[[2021,8,18]]}}}