{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:52:17Z","timestamp":1771955537768,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"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":["CCF-1314590"],"award-info":[{"award-number":["CCF-1314590"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612687","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"96-107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Phase-concurrent hash tables for determinism"],"prefix":"10.1145","author":[{"given":"Julian","family":"Shun","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1618452.1618500"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1081-y"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145840"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1333875.1334201"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_6_1","volume-title":"Usenix HotPar","author":"Bocchino R. L.","year":"2009","unstructured":"R. L. Bocchino , V. S. Adve , S. V. Adve , and M. Snir . Parallel programming must be deterministic by default . In Usenix HotPar , 2009 . R. L. Bocchino, V. S. Adve, S. V. Adve, and M. Snir. Parallel programming must be deterministic by default. In Usenix HotPar, 2009."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508255"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/22952.22954"},{"key":"e_1_3_2_1_10_1","first-page":"371","volume-title":"Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation","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 Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation , pages 371 -- 384 , 2013 . B. Fan, D. G. Andersen, and M. Kaminsky. MemC3: compact and concurrent memcache with dumber caching and smarter hashing. In Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation, pages 371--384, 2013."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-004-0115-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571874"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1140-z"},{"key":"e_1_3_2_1_14_1","volume-title":"Morgan Kaufmann","author":"Herlihy M.","year":"2012","unstructured":"M. Herlihy and N. Shavit . The Art of Multiprocessor Programming . Morgan Kaufmann , 2012 . M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_24"},{"key":"e_1_3_2_1_16_1","first-page":"241","volume-title":"Proceedings of Very Large Data Bases","author":"Hsu M.","year":"1986","unstructured":"M. Hsu and W.-P. Yang . Concurrent operations in extendible hashing . In Proceedings of Very Large Data Bases , pages 241 -- 247 , 1986 . M. Hsu and W.-P. Yang. Concurrent operations in extendible hashing. In Proceedings of Very Large Data Bases, pages 241--247, 1986."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"issue":"2","key":"e_1_3_2_1_18_1","first-page":"121","article-title":"Performance analysis of cache-conscious hashing techniques for multi-core CPUs","volume":"6","author":"Kim E.","year":"2013","unstructured":"E. Kim and M.-S. Kim . Performance analysis of cache-conscious hashing techniques for multi-core CPUs . International Journal of Control and Automation , 6 ( 2 ): 121 -- 134 , Apr. 2013 . E. Kim and M.-S. Kim. Performance analysis of cache-conscious hashing techniques for multi-core CPUs. International Journal of Control and Automation, 6(2):121--134, Apr. 2013.","journal-title":"International Journal of Control and Automation"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78979"},{"key":"e_1_3_2_1_20_1","unstructured":"D. Lea. Hash table util.concurrent.concurrenthashmap in java.util.concurrent the Java Concurrency Package.  D. Lea. Hash table util.concurrent.concurrenthashmap in java.util.concurrent the Java Concurrency Package."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592820"},{"key":"e_1_3_2_1_22_1","volume-title":"A scalable non-blocking concurrent hash table implementation with incremental rehashing. Unpublished manuscript","author":"Martin D. R.","year":"1997","unstructured":"D. R. Martin and R. C. Davis . A scalable non-blocking concurrent hash table implementation with incremental rehashing. Unpublished manuscript , 1997 . D. R. Martin and R. C. Davis. A scalable non-blocking concurrent hash table implementation with incremental rehashing. Unpublished manuscript, 1997."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564881"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380844"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508256"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_10"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147958"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486189"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612692"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96731"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the USENIX Annual Technical Conference","author":"Triplett J.","year":"2011","unstructured":"J. Triplett , P. E. McKenney , and J. Walpole . Resizable, scalable, concurrent hash tables via relativistic programming . In Proceedings of the USENIX Annual Technical Conference , 2011 . J. Triplett, P. E. McKenney, and J. Walpole. Resizable, scalable, concurrent hash tables via relativistic programming. In Proceedings of the USENIX Annual Technical Conference, 2011."},{"key":"e_1_3_2_1_34_1","volume-title":"15th Twente Student Conference on Information Technology","author":"van der Vegt S.","year":"2011","unstructured":"S. van der Vegt . A concurrent bidirectional linear probing algorithm . In 15th Twente Student Conference on Information Technology , 2011 . S. van der Vegt. A concurrent bidirectional linear probing algorithm. In 15th Twente Student Conference on Information Technology, 2011."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25929-6_18"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.9728"}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Prague Czech Republic","acronym":"SPAA '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612687","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612687"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":36,"alternative-id":["10.1145\/2612669.2612687","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612687","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}