{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:01:20Z","timestamp":1771700480320,"version":"3.50.1"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,1,20]],"date-time":"2016-01-20T00:00:00Z","timestamp":1453248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2016,1,20]]},"abstract":"<jats:p>Phase Change Memory (PCM) is emerging as an attractive alternative to Dynamic Random Access Memory (DRAM) in building data-intensive computing systems. PCM offers read\/write performance asymmetry that makes it necessary to revisit the design of in-memory applications. In this paper, we focus on in-memory hash tables, a family of data structures with wide applicability. We evaluate several popular hash-table designs to understand their performance under PCM. We find that for write-heavy workloads the designs that achieve best performance for PCMdiffer from the ones that are best for DRAM, and that designs achieving a high load factor also cause a high number of memory writes. Finally, we propose PFHT, a PCM-Friendly Hash Table which presents a cuckoo hashing variant that is tailored to PCM characteristics, and offers a better trade-off between performance, the amount of writes generated, and the expected load factor than any of the existing DRAMbased implementations.<\/jats:p>","DOI":"10.1145\/2883591.2883597","type":"journal-article","created":{"date-parts":[[2016,1,26]],"date-time":"2016-01-26T13:25:01Z","timestamp":1453814701000},"page":"18-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Revisiting Hash Table Design for Phase Change Memory"],"prefix":"10.1145","volume":"49","author":[{"given":"Biplob","family":"Debnath","sequence":"first","affiliation":[{"name":"NEC Laboratories America"}]},{"given":"Alireza","family":"Haghdoost","sequence":"additional","affiliation":[{"name":"University of Minnesota"}]},{"given":"Asim","family":"Kadav","sequence":"additional","affiliation":[{"name":"NEC Laboratories America"}]},{"given":"Mohammed G.","family":"Khatib","sequence":"additional","affiliation":[{"name":"HGST"}]},{"given":"Cristian","family":"Ungureanu","sequence":"additional","affiliation":[{"name":"Google"}]}],"member":"320","published-online":{"date-parts":[[2016,1,20]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"10\n    GEN INC. Mongo-DB: Open source document database. http:\/\/www.mongodb.org\/.  10 GEN INC. Mongo-DB: Open source document database. http:\/\/www.mongodb.org\/."},{"key":"e_1_2_1_2_1","volume-title":"ACSC","author":"ASKITIS N.","year":"2009"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254766"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2534500"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_2_1_6_1","volume-title":"CIDR","author":"CHEN S.","year":"2011"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950380"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629589"},{"key":"e_1_2_1_9_1","volume-title":"USENIX Security Symposium","author":"CROSBY S. A.","year":"2003"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.054"},{"key":"e_1_2_1_12_1","volume-title":"Workshop on Distributed Data and Structures","author":"ERLINGSSON U.","year":"2006"},{"key":"e_1_2_1_13_1","unstructured":"FAL LABS. Tokyo Cabinet: a modern implementation of DBM. http:\/\/fallabs.com\/tokyocabinet\/.  FAL LABS. Tokyo Cabinet: a modern implementation of DBM. http:\/\/fallabs.com\/tokyocabinet\/."},{"key":"e_1_2_1_14_1","volume-title":"NSDI","author":"FAN B.","year":"2013"},{"key":"e_1_2_1_15_1","volume":"124","author":"FITZPATRICK","year":"2004","journal-title":"Distributed Caching with Memcached. LINUX Journal"},{"key":"e_1_2_1_16_1","volume-title":"STACS","author":"FOTAKIS D.","year":"2003"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_24"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454211"},{"key":"e_1_2_1_19_1","volume-title":"FAST","author":"KIM H.","year":"2014"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2047868"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/080728743"},{"key":"e_1_2_1_22_1","volume-title":"Inc.","author":"KNUTH D.","year":"1998"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592820"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043558"},{"key":"e_1_2_1_26_1","unstructured":"MERRIMAN D. A. AND O'CONNOR K. J. Method of delivery targeting and measuring advertising over networks Sept. 7 1999. US Patent 5 948 061.  MERRIMAN D. A. AND O'CONNOR K. J. Method of delivery targeting and measuring advertising over networks Sept. 7 1999. US Patent 5 948 061."},{"key":"e_1_2_1_27_1","volume-title":"NSDI","author":"NISHTALA R.","year":"2013"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_2_1_29_1","volume-title":"SODA","author":"PANIGRAHY R.","year":"2005"},{"key":"e_1_2_1_30_1","volume-title":"ISCA","author":"QURESHI M. K.","year":"2009"},{"key":"e_1_2_1_31_1","volume-title":"ICDE","author":"ROSS K. A.","year":"2007"},{"key":"e_1_2_1_32_1","unstructured":"SPOTIFY INC. New open source key-value store: sparkey. http:\/\/labs.spotify.com\/2013\/09\/03\/sparkey\/.  SPOTIFY INC. New open source key-value store: sparkey. http:\/\/labs.spotify.com\/2013\/09\/03\/sparkey\/."},{"key":"e_1_2_1_33_1","volume-title":"FAST","author":"VENKATARAMAN S.","year":"2011"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732277"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950379"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140402.1140410"}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2883591.2883597","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2883591.2883597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:11Z","timestamp":1750273451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2883591.2883597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,20]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,1,20]]}},"alternative-id":["10.1145\/2883591.2883597"],"URL":"https:\/\/doi.org\/10.1145\/2883591.2883597","relation":{},"ISSN":["0163-5980"],"issn-type":[{"value":"0163-5980","type":"print"}],"subject":[],"published":{"date-parts":[[2016,1,20]]},"assertion":[{"value":"2016-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}