{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:55:21Z","timestamp":1773482121085,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T00:00:00Z","timestamp":1683504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS- 1817120"],"award-info":[{"award-number":["CNS- 1817120"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,5,8]]},"DOI":"10.1145\/3552326.3587457","type":"proceedings-article","created":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T17:33:02Z","timestamp":1683307982000},"page":"817-834","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["DRAMHiT: A Hash Table Architected for the Speed of DRAM"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6274-9242","authenticated-orcid":false,"given":"Vikram","family":"Narayanan","sequence":"first","affiliation":[{"name":"University of Utah, Salt Lake City, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2094-106X","authenticated-orcid":false,"given":"David","family":"Detweiler","sequence":"additional","affiliation":[{"name":"University of California, Irvine, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5017-534X","authenticated-orcid":false,"given":"Tianjiao","family":"Huang","sequence":"additional","affiliation":[{"name":"University of California, Irvine, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8769-8373","authenticated-orcid":false,"given":"Anton","family":"Burtsev","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,5,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Yonggang Wen. Balanced Hashing and Efficient GPU Sparse General Matrix-Matrix Multiplication. In Proceedings of the 2016 International Conference on Supercomputing (ICS '16)","author":"Quang Anh Pham Nguyen","year":"2016","unstructured":"Pham Nguyen Quang Anh , Rui Fan , and Yonggang Wen. Balanced Hashing and Efficient GPU Sparse General Matrix-Matrix Multiplication. In Proceedings of the 2016 International Conference on Supercomputing (ICS '16) , 2016 . Pham Nguyen Quang Anh, Rui Fan, and Yonggang Wen. Balanced Hashing and Efficient GPU Sparse General Matrix-Matrix Multiplication. In Proceedings of the 2016 International Conference on Supercomputing (ICS '16), 2016."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544839"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989328"},{"key":"e_1_3_2_1_4_1","first-page":"119","volume-title":"Proceedings of the Linux Symposium","author":"Boyd-Wickizer Silas","year":"2012","unstructured":"Silas Boyd-Wickizer , M Frans Kaashoek , Robert Morris , and Nickolai Zeldovich . Non-scalable locks are dangerous . In Proceedings of the Linux Symposium , pages 119 -- 130 , 2012 . Silas Boyd-Wickizer, M Frans Kaashoek, Robert Morris, and Nickolai Zeldovich. Non-scalable locks are dangerous. In Proceedings of the Linux Symposium, pages 119--130, 2012."},{"key":"e_1_3_2_1_5_1","unstructured":"Intel Corporporation. Intel\u00ae Memory Latency Checker. https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/articles\/tool\/intelr-memory-latency-checker.html. Accessed: 2022-05-18.  Intel Corporporation. Intel \u00ae Memory Latency Checker. https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/articles\/tool\/intelr-memory-latency-checker.html. Accessed: 2022-05-18."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522714"},{"key":"e_1_3_2_1_7_1","first-page":"151","volume-title":"DeWitt and Robert Gerber. Multiprocessor Hash-Based Join Algorithms. In Proceedings of the 11th International Conference on Very Large Data Bases (VLDB '85)","author":"David","year":"1985","unstructured":"David J DeWitt and Robert Gerber. Multiprocessor Hash-Based Join Algorithms. In Proceedings of the 11th International Conference on Very Large Data Bases (VLDB '85) , pages 151 -- 164 , 1985 . David J DeWitt and Robert Gerber. Multiprocessor Hash-Based Join Algorithms. In Proceedings of the 11th International Conference on Very Large Data Bases (VLDB '85), pages 151--164, 1985."},{"key":"e_1_3_2_1_8_1","first-page":"523","volume-title":"Jinnah Dylan Hosein. Maglev: A Fast and Reliable Software Network Load Balancer. In 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI '16)","author":"Eisenbud Daniel E.","year":"2016","unstructured":"Daniel E. Eisenbud , Cheng Yi , Carlo Contavalli , Cody Smith , Roman Kononov , Eric Mann-Hielscher , Ardas Cilingiroglu , Bin Cheyney , Wentao Shang , and Jinnah Dylan Hosein. Maglev: A Fast and Reliable Software Network Load Balancer. In 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI '16) , pages 523 -- 535 , 2016 . Daniel E. Eisenbud, Cheng Yi, Carlo Contavalli, Cody Smith, Roman Kononov, Eric Mann-Hielscher, Ardas Cilingiroglu, Bin Cheyney, Wentao Shang, and Jinnah Dylan Hosein. Maglev: A Fast and Reliable Software Network Load Balancer. In 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI '16), pages 523--535, 2016."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/588058.588072"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/22952.22954"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-017-0097-9"},{"key":"e_1_3_2_1_12_1","unstructured":"Flux Research Group. CloudLab Web site. http:\/\/www.cloudlab.us.  Flux Research Group. CloudLab Web site. http:\/\/www.cloudlab.us."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-004-0115-2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345215"},{"key":"e_1_3_2_1_15_1","volume-title":"The CityHash family of hash functions","unstructured":"Google. The CityHash family of hash functions . http:\/\/code.google.com\/p\/cityhash\/. Accessed: 2021-01-12. Google. The CityHash family of hash functions. http:\/\/code.google.com\/p\/cityhash\/. Accessed: 2021-01-12."},{"key":"e_1_3_2_1_16_1","unstructured":"Google. Folly: Facebook Open-source Library. https:\/\/github.com\/facebook\/folly\/. Accessed: 2021-01-12.  Google. Folly: Facebook Open-source Library. https:\/\/github.com\/facebook\/folly\/. Accessed: 2021-01-12."},{"key":"e_1_3_2_1_17_1","first-page":"260","volume-title":"Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC '02)","author":"Greenwald Michael","year":"2002","unstructured":"Michael Greenwald . Two-handed emulation : How to build non-blocking implementations of complex data-structures using dcas . In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC '02) , pages 260 -- 269 . Association for Computing Machinery , 2002 . Michael Greenwald. Two-handed emulation: How to build non-blocking implementations of complex data-structures using dcas. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC '02), pages 260--269. Association for Computing Machinery, 2002."},{"key":"e_1_3_2_1_18_1","first-page":"355","volume-title":"Moran Tzafrir. Flat Combining and the Synchronization-Parallelism Tradeoff. In Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '10)","author":"Hendler Danny","year":"2010","unstructured":"Danny Hendler , Itai Incze , Nir Shavit , and Moran Tzafrir. Flat Combining and the Synchronization-Parallelism Tradeoff. In Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '10) , pages 355 -- 364 , 2010 . Danny Hendler, Itai Incze, Nir Shavit, and Moran Tzafrir. Flat Combining and the Synchronization-Parallelism Tradeoff. In Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '10), pages 355--364, 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1734069"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_24"},{"key":"e_1_3_2_1_21_1","first-page":"241","volume-title":"Hsu and Wei-Pang Yang. Concurrent Operations in Extendible Hashing. In Proceedings of the 12th International Conference on Very Large Data Bases (VLDB '86)","author":"Meichun","year":"1986","unstructured":"Meichun Hsu and Wei-Pang Yang. Concurrent Operations in Extendible Hashing. In Proceedings of the 12th International Conference on Very Large Data Bases (VLDB '86) , pages 241 -- 247 , aug 1986 . Meichun Hsu and Wei-Pang Yang. Concurrent Operations in Extendible Hashing. In Proceedings of the 12th International Conference on Very Large Data Bases (VLDB '86), pages 241--247, aug 1986."},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the Eigth Workshop on Explicitly Parallel Instruction Computer Architectures and Compiler Technology (EPIC)","author":"Jablin Thomas B","year":"2010","unstructured":"Thomas B Jablin , Yun Zhang , James A Jablin , Jialu Huang , Hanjun Kim , and David I August . Liberty queues for epic architectures . In Proceedings of the Eigth Workshop on Explicitly Parallel Instruction Computer Architectures and Compiler Technology (EPIC) , 2010 . Thomas B Jablin, Yun Zhang, James A Jablin, Jialu Huang, Hanjun Kim, and David I August. Liberty queues for epic architectures. In Proceedings of the Eigth Workshop on Explicitly Parallel Instruction Computer Architectures and Compiler Technology (EPIC), 2010."},{"key":"e_1_3_2_1_23_1","unstructured":"John McCalpin. Topology and Cache Coherence in Knights Landing and Skylake Xeon Processors. https:\/\/www.ixpug.org\/documents\/1524216121knl_skx_topology_coherence_2018-03-23.pptx. Accessed 2022-10-10.  John McCalpin. Topology and Cache Coherence in Knights Landing and Skylake Xeon Processors. https:\/\/www.ixpug.org\/documents\/1524216121knl_skx_topology_coherence_2018-03-23.pptx. Accessed 2022-10-10."},{"key":"e_1_3_2_1_24_1","volume-title":"A fast concurrent and resizable Robin Hood hash table","author":"Kahssay Endrias","year":"2021","unstructured":"Endrias Kahssay . A fast concurrent and resizable Robin Hood hash table , 2021 . Endrias Kahssay. A fast concurrent and resizable Robin Hood hash table, 2021."},{"key":"e_1_3_2_1_25_1","first-page":"1378","volume-title":"Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs. In Proceedings of the VLDB Endowment","volume":"2","author":"Kim Changkyu","year":"2009","unstructured":"Changkyu Kim , Tim Kaldewey , Victor W. Lee , Eric Sedlar , Anthony D. Nguyen , Nadathur Satish , Jatin Chhugani , Andrea Di Blas , and Pradeep Dubey . Sort vs . Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs. In Proceedings of the VLDB Endowment , volume 2 , pages 1378 -- 1389 , Aug 2009 . Changkyu Kim, Tim Kaldewey, Victor W. Lee, Eric Sedlar, Anthony D. Nguyen, Nadathur Satish, Jatin Chhugani, Andrea Di Blas, and Pradeep Dubey. Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs. In Proceedings of the VLDB Endowment, volume 2, pages 1378--1389, Aug 2009."},{"key":"e_1_3_2_1_26_1","volume-title":"Kmc 3: counting and manipulating k-mer statistics. Bioinformatics, 33(17):2759--2761","author":"Kokot Marek","year":"2017","unstructured":"Marek Kokot , Maciej D\u0142ugosz , and Sebastian Deorowicz . Kmc 3: counting and manipulating k-mer statistics. Bioinformatics, 33(17):2759--2761 , 2017 . Marek Kokot, Maciej D\u0142ugosz, and Sebastian Deorowicz. Kmc 3: counting and manipulating k-mer statistics. Bioinformatics, 33(17):2759--2761, 2017."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78979"},{"key":"e_1_3_2_1_28_1","volume-title":"Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems (TOPLAS), 5(2):190--222","author":"Lamport Leslie","year":"1983","unstructured":"Leslie Lamport . Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems (TOPLAS), 5(2):190--222 , 1983 . Leslie Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems (TOPLAS), 5(2):190--222, 1983."},{"key":"e_1_3_2_1_29_1","unstructured":"Doug Lea. util.concurrent.ConcurrentHashMap revision 1.3. JSR-166 the Proposed Java ConcurrencyPackage. http:\/\/gee.cs.oswego.edu\/cgi-bin\/viewcvs.cgi\/jsr166\/src\/main\/java\/util\/concurrent 2003.  Doug Lea. util.concurrent.ConcurrentHashMap revision 1.3. JSR-166 the Proposed Java ConcurrencyPackage. http:\/\/gee.cs.oswego.edu\/cgi-bin\/viewcvs.cgi\/jsr166\/src\/main\/java\/util\/concurrent 2003."},{"key":"e_1_3_2_1_30_1","first-page":"78","volume-title":"Cache-Efficient Shared Ring Buffer for Multi-Core Architectures. In Proceedings of the 5th ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS '09)","author":"Lee Patrick P. C.","year":"2009","unstructured":"Patrick P. C. Lee , Tian Bu , and Girish Chandranmenon . A Lock-Free , Cache-Efficient Shared Ring Buffer for Multi-Core Architectures. In Proceedings of the 5th ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS '09) , pages 78 -- 79 , 2009 . Patrick P. C. Lee, Tian Bu, and Girish Chandranmenon. A Lock-Free, Cache-Efficient Shared Ring Buffer for Multi-Core Architectures. In Proceedings of the 5th ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS '09), pages 78--79, 2009."},{"key":"e_1_3_2_1_31_1","unstructured":"Daniel Lemire. fastrange: A fast alternative to the modulo reduction. https:\/\/github.com\/lemire\/fastrange\/. Accessed: 2023-02-20.  Daniel Lemire. fastrange: A fast alternative to the modulo reduction. https:\/\/github.com\/lemire\/fastrange\/. Accessed: 2023-02-20."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592820"},{"key":"e_1_3_2_1_33_1","first-page":"429","volume-title":"11th USENIX Symposium on Networked Systems Design and Implementation (NSDI '14)","author":"Lim Hyeontaek","year":"2014","unstructured":"Hyeontaek Lim , Dongsu Han , David G. Andersen , and Michael Kaminsky . MICA : A Holistic Approach to Fast In-Memory Key-Value Storage . In 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI '14) , pages 429 -- 444 , 2014 . Hyeontaek Lim, Dongsu Han, David G. Andersen, and Michael Kaminsky. MICA: A Holistic Approach to Fast In-Memory Key-Value Storage. In 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI '14), pages 429--444, 2014."},{"key":"e_1_3_2_1_34_1","first-page":"314","volume-title":"Nir Shavit. Nonblocking K-Compare-Single-Swap. In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '03)","author":"Luchangco Victor","year":"2003","unstructured":"Victor Luchangco , Mark Moir , and Nir Shavit. Nonblocking K-Compare-Single-Swap. In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '03) , pages 314 -- 323 , 2003 . Victor Luchangco, Mark Moir, and Nir Shavit. Nonblocking K-Compare-Single-Swap. In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '03), pages 314--323, 2003."},{"key":"e_1_3_2_1_35_1","volume-title":"February","author":"Maier Tobias","year":"2019","unstructured":"Tobias Maier , Peter Sanders , and Roman Dementiev . Concurrent Hash Tables: Fast and General(?)! ACM Transactions on Parallel Computing, 5(4) , February 2019 . Tobias Maier, Peter Sanders, and Roman Dementiev. Concurrent Hash Tables: Fast and General(?)! ACM Transactions on Parallel Computing, 5(4), February 2019."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr011"},{"key":"e_1_3_2_1_37_1","volume-title":"Parallel and Distributed Computing and Systems","volume":"509518","author":"McKenney Paul E","year":"1998","unstructured":"Paul E McKenney and John D Slingwine . Read-copy update : Using execution history to solve concurrency problems . In Parallel and Distributed Computing and Systems , volume 509518 , 1998 . Paul E McKenney and John D Slingwine. Read-copy update: Using execution history to solve concurrency problems. In Parallel and Distributed Computing and Systems, volume 509518, 1998."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1404505"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145874"},{"key":"e_1_3_2_1_40_1","first-page":"73","volume-title":"Michael. High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '02)","author":"Maged","year":"2002","unstructured":"Maged M. Michael. High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '02) , pages 73 -- 82 , 2002 . Maged M. Michael. High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '02), pages 73--82, 2002."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926274"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2618128.2618129"},{"key":"e_1_3_2_1_43_1","volume-title":"Robert Sch\u00f6ne. Main Memory and Cache Performance of Intel Sandy Bridge and AMD Bulldozer. In Proceedings of the Workshop on Memory Systems Performance and Correctness (MSPC '14)","author":"Molka Daniel","year":"2014","unstructured":"Daniel Molka , Daniel Hackenberg , and Robert Sch\u00f6ne. Main Memory and Cache Performance of Intel Sandy Bridge and AMD Bulldozer. In Proceedings of the Workshop on Memory Systems Performance and Correctness (MSPC '14) . Association for Computing Machinery , 2014 . Daniel Molka, Daniel Hackenberg, and Robert Sch\u00f6ne. Main Memory and Cache Performance of Intel Sandy Bridge and AMD Bulldozer. In Proceedings of the Workshop on Memory Systems Performance and Correctness (MSPC '14). Association for Computing Machinery, 2014."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2009.22"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00014"},{"key":"e_1_3_2_1_47_1","first-page":"1","volume-title":"2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS)","author":"Tian Bu","year":"2010","unstructured":"Tian Bu Patrick P. C. Lee and Girish Chandranmenon. A lock-free, cache-efficient multi-core synchronization mechanism for line-rate network traffic monitoring . In 2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS) , pages 1 -- 12 , 2010 . Tian Bu Patrick P. C. Lee and Girish Chandranmenon. A lock-free, cache-efficient multi-core synchronization mechanism for line-rate network traffic monitoring. In 2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS), pages 1--12, 2010."},{"key":"e_1_3_2_1_48_1","volume-title":"Linux.Conf.Au","author":"McKenney Paul E.","year":"2004","unstructured":"Paul E. McKenney . RCU vs. locking performance on different CPUs . In Linux.Conf.Au , 2004 . Paul E. McKenney. RCU vs. locking performance on different CPUs. In Linux.Conf.Au, 2004."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/1352079.1352134"},{"key":"e_1_3_2_1_50_1","unstructured":"Nick Piggin. ddds: \"dynamic dynamic data structure\" algorithm for adaptive dcache hash table sizing (resend). https:\/\/lwn.net\/Articles\/302132\/. Accessed: 2022-10-10.  Nick Piggin. ddds: \"dynamic dynamic data structure\" algorithm for adaptive dcache hash table sizing (resend). https:\/\/lwn.net\/Articles\/302132\/. Accessed: 2022-10-10."},{"key":"e_1_3_2_1_51_1","unstructured":"Jeff Preshing. Junction. https:\/\/github.com\/preshing\/junction\/. Accessed: 2021-01-12.  Jeff Preshing. Junction. https:\/\/github.com\/preshing\/junction\/. Accessed: 2021-01-12."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PAD.2010.34"},{"key":"e_1_3_2_1_53_1","volume-title":"Introducing Cloud-Lab: Scientific Infrastructure for Advancing Cloud Architectures and Applications","author":"Ricci Robert","year":"2014","unstructured":"Robert Ricci , Eric Eide , and The CloudLab Team . Introducing Cloud-Lab: Scientific Infrastructure for Advancing Cloud Architectures and Applications . ; login:: the magazine of USENIX & SAGE , 39(6):36--38, 2014 . Robert Ricci, Eric Eide, and The CloudLab Team. Introducing Cloud-Lab: Scientific Infrastructure for Advancing Cloud Architectures and Applications. ; login:: the magazine of USENIX & SAGE, 39(6):36--38, 2014."},{"key":"e_1_3_2_1_54_1","unstructured":"Erik Rigtorp. Aligned AVX loads and stores are atomic. https:\/\/rigtorp.se\/isatomic\/. Accessed: 2022-05-18.  Erik Rigtorp. Aligned AVX loads and stores are atomic. https:\/\/rigtorp.se\/isatomic\/. Accessed: 2022-05-18."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132771"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/6314.6315"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-021-03996-x"},{"key":"e_1_3_2_1_58_1","first-page":"96","volume-title":"Shun and Guy E. Blelloch. Phase-Concurrent Hash Tables for Determinism. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '14)","author":"Julian","year":"2014","unstructured":"Julian Shun and Guy E. Blelloch. Phase-Concurrent Hash Tables for Determinism. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '14) , pages 96 -- 107 , 2014 . Julian Shun and Guy E. Blelloch. Phase-Concurrent Hash Tables for Determinism. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '14), pages 96--107, 2014."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.01.004"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1996.545653"},{"key":"e_1_3_2_1_61_1","volume-title":"Relativistic Programming. In 2011 USENIX Annual Technical Conference (USENIX ATC 11)","author":"Triplett Josh","year":"2011","unstructured":"Josh Triplett , Paul E McKenney , and Jonathan Walpole . Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming. In 2011 USENIX Annual Technical Conference (USENIX ATC 11) , 2011 . Josh Triplett, Paul E McKenney, and Jonathan Walpole. Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming. In 2011 USENIX Annual Technical Conference (USENIX ATC 11), 2011."},{"key":"e_1_3_2_1_62_1","first-page":"18","volume-title":"Samuel Madden. Speedy Transactions in Multicore In-Memory Databases. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (SOSP '13)","author":"Tu Stephen","year":"2013","unstructured":"Stephen Tu , Wenting Zheng , Eddie Kohler , Barbara Liskov , and Samuel Madden. Speedy Transactions in Multicore In-Memory Databases. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (SOSP '13) , pages 18 -- 32 , 2013 . Stephen Tu, Wenting Zheng, Eddie Kohler, Barbara Liskov, and Samuel Madden. Speedy Transactions in Multicore In-Memory Databases. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (SOSP '13), pages 18--32, 2013."},{"key":"e_1_3_2_1_63_1","first-page":"46","volume-title":"Concurrent Chaining Hash Maps for Software Model Checking. In 2019 Formal Methods in Computer Aided Design (FMCAD)","author":"Freark","year":"2019","unstructured":"Freark I. van der Berg and Jaco van de Pol . Concurrent Chaining Hash Maps for Software Model Checking. In 2019 Formal Methods in Computer Aided Design (FMCAD) , pages 46 -- 54 , 2019 . Freark I. van der Berg and Jaco van de Pol. Concurrent Chaining Hash Maps for Software Model Checking. In 2019 Formal Methods in Computer Aided Design (FMCAD), pages 46--54, 2019."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3489525.3511689"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2007.7"},{"issue":"3","key":"e_1_3_2_1_66_1","first-page":"05","article-title":"a robust and efficient k-mer counting algorithm based on a lock-free chaining hash table","volume":"22","author":"Wang Jianan","year":"2020","unstructured":"Jianan Wang , Su Chen , Lili Dong , and Guohua Wang . CHTKC : a robust and efficient k-mer counting algorithm based on a lock-free chaining hash table . Briefings in Bioinformatics , 22 ( 3 ), 05 2020 . Jianan Wang, Su Chen, Lili Dong, and Guohua Wang. CHTKC: a robust and efficient k-mer counting algorithm based on a lock-free chaining hash table. Briefings in Bioinformatics, 22(3), 05 2020.","journal-title":"Briefings in Bioinformatics"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-012-0213-x"},{"key":"e_1_3_2_1_68_1","unstructured":"Herbert Xu. bridge: Add core igmp snooping support. http:\/\/git.kernel.org\/linus\/eb1d16414339a6e113d89e2cca2556005d7ce919. Accessed: 2022-10-10.  Herbert Xu. bridge: Add core igmp snooping support. http:\/\/git.kernel.org\/linus\/eb1d16414339a6e113d89e2cca2556005d7ce919. Accessed: 2022-10-10."}],"event":{"name":"EuroSys '23: Eighteenth European Conference on Computer Systems","location":"Rome Italy","acronym":"EuroSys '23","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the Eighteenth European Conference on Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3552326.3587457","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3552326.3587457","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3552326.3587457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:40Z","timestamp":1750178860000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3552326.3587457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,8]]},"references-count":68,"alternative-id":["10.1145\/3552326.3587457","10.1145\/3552326"],"URL":"https:\/\/doi.org\/10.1145\/3552326.3587457","relation":{},"subject":[],"published":{"date-parts":[[2023,5,8]]},"assertion":[{"value":"2023-05-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}