{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:56Z","timestamp":1750220636733,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:00:00Z","timestamp":1601251200000},"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":[],"published-print":{"date-parts":[[2020,9,28]]},"DOI":"10.1145\/3422575.3422776","type":"proceedings-article","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T01:43:40Z","timestamp":1616377420000},"page":"39-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Hash Table Design for NDP Systems"],"prefix":"10.1145","author":[{"given":"Pranith","family":"Kumar","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyesoon","family":"Kim","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872887.2750385"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2015.129"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528521.1508273"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358278"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00070"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2971808.2972100"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1247360.1247401"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA45697.2020.00072"},{"key":"e_1_3_2_1_9_1","unstructured":"Hybrid Memory\u00a0Cube Consortium. 2014. Hybrid Memory Cube Specification 2.0.  Hybrid Memory\u00a0Cube Consortium. 2014. Hybrid Memory Cube Specification 2.0."},{"key":"e_1_3_2_1_10_1","unstructured":"Emilio\u00a0G. Cota. 2017. Quick Hash Table. https:\/\/github.com\/pranith\/quickht  Emilio\u00a0G. Cota. 2017. Quick Hash Table. https:\/\/github.com\/pranith\/quickht"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2019.8875680"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2014.2333735"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2015.7056040"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.22"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093337.3037702"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967938.2967958"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2523721.2523744"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898064"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087582"},{"key":"e_1_3_2_1_20_1","unstructured":"Paul\u00a0E McKenney. 2017. Sequence Locks. In Is parallel programming hard and if so what can you do about it? Chapter 9.4.  Paul\u00a0E McKenney. 2017. Sequence Locks. In Is parallel programming hard and if so what can you do about it? Chapter 9.4."},{"key":"e_1_3_2_1_21_1","unstructured":"Andreas Olofsson Tomas Nordstr\u00f6m and Zain-ul-Abdin. 2014. Kickstarting High-performance Energy-efficient Manycore Architectures with Epiphany. CoRR abs\/1412.5538(2014). http:\/\/arxiv.org\/abs\/1412.5538  Andreas Olofsson Tomas Nordstr\u00f6m and Zain-ul-Abdin. 2014. Kickstarting High-performance Energy-efficient Manycore Architectures with Epiphany. CoRR abs\/1412.5538(2014). http:\/\/arxiv.org\/abs\/1412.5538"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967938.2967940"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.24"},{"key":"e_1_3_2_1_24_1","unstructured":"Amanda\u00a0K Sharp. 2013. Memory Layout Transformations. (2013). https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/articles\/memory-layout-transformations.html  Amanda\u00a0K Sharp. 2013. Memory Layout Transformations. (2013). https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/articles\/memory-layout-transformations.html"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600213"}],"event":{"name":"MEMSYS 2020: The International Symposium on Memory Systems","acronym":"MEMSYS 2020","location":"Washington DC USA"},"container-title":["The International Symposium on Memory Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422575.3422776","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3422575.3422776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:55Z","timestamp":1750197715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422575.3422776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,28]]},"references-count":25,"alternative-id":["10.1145\/3422575.3422776","10.1145\/3422575"],"URL":"https:\/\/doi.org\/10.1145\/3422575.3422776","relation":{},"subject":[],"published":{"date-parts":[[2020,9,28]]},"assertion":[{"value":"2021-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}