{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T21:07:25Z","timestamp":1774732045996,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,4,14]],"date-time":"2014-04-14T00:00:00Z","timestamp":1397433600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CSR-0953197 (CAREER), CCF-0964474"],"award-info":[{"award-number":["CSR-0953197 (CAREER), CCF-0964474"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CSR-0953197 (CAREER), CCF-0964474"],"award-info":[{"award-number":["CSR-0953197 (CAREER), CCF-0964474"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,4,14]]},"DOI":"10.1145\/2592798.2592820","type":"proceedings-article","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T14:18:30Z","timestamp":1398694710000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":117,"title":["Algorithmic improvements for fast concurrent Cuckoo hashing"],"prefix":"10.1145","author":[{"given":"Xiaozhou","family":"Li","sequence":"first","affiliation":[{"name":"Princeton University"}]},{"given":"David G.","family":"Andersen","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Michael","family":"Kaminsky","sequence":"additional","affiliation":[{"name":"Intel Labs"}]},{"given":"Michael J.","family":"Freedman","sequence":"additional","affiliation":[{"name":"Princeton University"}]}],"member":"320","published-online":{"date-parts":[[2014,4,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Intel\u00ae 64 and IA-32 Architectures Software Developer's Manual. Number 253665-047US. Intel Corporation June 2013. Intel \u00ae 64 and IA-32 Architectures Software Developer's Manual . Number 253665-047US. Intel Corporation June 2013."},{"key":"e_1_3_2_1_2_1","unstructured":"Intel Threading Building Block. https:\/\/www.threadingbuildingblocks.org\/.  Intel Threading Building Block. https:\/\/www.threadingbuildingblocks.org\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2009.34"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755918"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2010.40"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508263"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. 7th Workshop on Distributed Data and Structures (WDAS'06)","author":"Erlingsson U.","year":"2006","unstructured":"U. Erlingsson , M. Manasse , and F. McSherry . A Cool and Practical Alternative to Traditional Hash Tables . In Proc. 7th Workshop on Distributed Data and Structures (WDAS'06) , Santa Clara, CA , Jan. 2006 . U. Erlingsson, M. Manasse, and F. McSherry. A Cool and Practical Alternative to Traditional Hash Tables. In Proc. 7th Workshop on Distributed Data and Structures (WDAS'06), Santa Clara, CA, Jan. 2006."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. 10th USENIX NSDI","author":"Fan B.","year":"2013","unstructured":"B. Fan , D. G. Andersen , and M. Kaminsky . MemC3: Compact and Concurrent Memcache with Dumber Caching and Smarter Hashing . In Proc. 10th USENIX NSDI , Lombard, IL , Apr. 2013 . B. Fan, D. G. Andersen, and M. Kaminsky. MemC3: Compact and Concurrent Memcache with Dumber Caching and Smarter Hashing. In Proc. 10th USENIX NSDI, Lombard, IL, Apr. 2013."},{"key":"e_1_3_2_1_9_1","unstructured":"Google SparseHash. https:\/\/code.google.com\/p\/sparsehash\/.  Google SparseHash. https:\/\/code.google.com\/p\/sparsehash\/."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_11_1","volume-title":"The Art of Multiprocessor Programming","author":"Herlihy M.","year":"2008","unstructured":"M. Herlihy and N. Shavit . The Art of Multiprocessor Programming . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 2008 . M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2008."},{"key":"e_1_3_2_1_12_1","unstructured":"Intel Performance Counter Monitor. www.intel.com\/software\/pcm.  Intel Performance Counter Monitor. www.intel.com\/software\/pcm."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2012.12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_3_2_1_15_1","unstructured":"libcuckoo. https:\/\/github.com\/efficient\/libcuckoo.  libcuckoo. https:\/\/github.com\/efficient\/libcuckoo."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_17_1","first-page":"338","volume-title":"Read-Copy Update. In In Ottawa Linux Symposium","author":"McKenney P. E.","year":"2001","unstructured":"P. E. McKenney , D. Sarma , A. Arcangeli , A. Kleen , O. Krieger , and R. Russell . Read-Copy Update. In In Ottawa Linux Symposium , pages 338 -- 367 , 2001 . P. E. McKenney, D. Sarma, A. Arcangeli, A. Kleen, O. Krieger, and R. Russell. Read-Copy Update. In In Ottawa Linux Symposium, pages 338--367, 2001."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_1_19_1","first-page":"11","volume-title":"Proc. USENIX ATC","author":"Triplett J.","year":"2011","unstructured":"J. Triplett , P. E. McKenney , and J. Walpole . Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming . In Proc. USENIX ATC , pages 11 -- 11 , 2011 . J. Triplett, P. E. McKenney, and J. Walpole. Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming. In Proc. USENIX ATC, pages 11--11, 2011."},{"key":"e_1_3_2_1_20_1","unstructured":"TSX lock elision for glibc. https:\/\/github.com\/andikleen\/glibc.  TSX lock elision for glibc. https:\/\/github.com\/andikleen\/glibc."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370836"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503232"}],"event":{"name":"EuroSys 2014: Ninth Eurosys Conference 2014","location":"Amsterdam The Netherlands","acronym":"EuroSys 2014","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the Ninth European Conference on Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2592798.2592820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2592798.2592820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:58Z","timestamp":1750229758000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2592798.2592820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,14]]},"references-count":22,"alternative-id":["10.1145\/2592798.2592820","10.1145\/2592798"],"URL":"https:\/\/doi.org\/10.1145\/2592798.2592820","relation":{},"subject":[],"published":{"date-parts":[[2014,4,14]]},"assertion":[{"value":"2014-04-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}