{"id":"https://openalex.org/W2047662881","doi":"https://doi.org/10.1145/2612669.2612687","title":"Phase-concurrent hash tables for determinism","display_name":"Phase-concurrent hash tables for determinism","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2047662881","doi":"https://doi.org/10.1145/2612669.2612687","mag":"2047662881"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612687","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051583907","display_name":"Julian Shun","orcid":"https://orcid.org/0000-0001-6163-6625"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Julian Shun","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051583907"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":9.1371,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.98210024,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"96","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.6540277600288391},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.650153398513794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6453829407691956},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.6201050281524658},{"id":"https://openalex.org/keywords/rolling-hash","display_name":"Rolling hash","score":0.5975071787834167},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.555108368396759},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.5165961980819702},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4236282408237457},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35698172450065613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20301735401153564},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.17079293727874756},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1138451099395752},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.0764683187007904}],"concepts":[{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.6540277600288391},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.650153398513794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6453829407691956},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6201050281524658},{"id":"https://openalex.org/C108546238","wikidata":"https://www.wikidata.org/wiki/Q4228982","display_name":"Rolling hash","level":5,"score":0.5975071787834167},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.555108368396759},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.5165961980819702},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4236282408237457},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35698172450065613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20301735401153564},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.17079293727874756},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1138451099395752},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0764683187007904}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2612669.2612687","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.698.2353","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.2353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.berkeley.edu/%7Ejshun/hash.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G1729762834","display_name":null,"funder_award_id":"CCF-1314590","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W27678557","https://openalex.org/W83339351","https://openalex.org/W1482680420","https://openalex.org/W1606270358","https://openalex.org/W1873283820","https://openalex.org/W1931688030","https://openalex.org/W1963506672","https://openalex.org/W1967569591","https://openalex.org/W1971544679","https://openalex.org/W1979201594","https://openalex.org/W1981032891","https://openalex.org/W1983572666","https://openalex.org/W1993101773","https://openalex.org/W2013081353","https://openalex.org/W2016559894","https://openalex.org/W2024794876","https://openalex.org/W2042661579","https://openalex.org/W2070232376","https://openalex.org/W2082929693","https://openalex.org/W2084802221","https://openalex.org/W2096830363","https://openalex.org/W2098297530","https://openalex.org/W2099899133","https://openalex.org/W2115389583","https://openalex.org/W2121433887","https://openalex.org/W2122532513","https://openalex.org/W2123290522","https://openalex.org/W2134440791","https://openalex.org/W2152849336","https://openalex.org/W2157092502","https://openalex.org/W2159392969","https://openalex.org/W2182158953","https://openalex.org/W2912516925","https://openalex.org/W2912601938","https://openalex.org/W2913334236","https://openalex.org/W4285719527","https://openalex.org/W6639037632","https://openalex.org/W6646522387"],"related_works":["https://openalex.org/W2069568684","https://openalex.org/W113683524","https://openalex.org/W2376661060","https://openalex.org/W2347294433","https://openalex.org/W3018807086","https://openalex.org/W2119251656","https://openalex.org/W2068448121","https://openalex.org/W2154676777","https://openalex.org/W3131985603","https://openalex.org/W2982222368"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,34],"deterministic":[3,35],"phase-concurrent":[4],"hash":[5,36,61,78,81],"table":[6,37,45,62,82],"in":[7],"which":[8],"operations":[9,20,31,72],"of":[10,21,43,52,55],"the":[11,41,44,53],"same":[12],"type":[13],"are":[14,24],"allowed":[15],"to":[16,63],"proceed":[17],"concurrently,":[18],"but":[19],"different":[22],"types":[23],"not.":[25],"Phase-concurrency":[26],"guarantees":[27],"that":[28,40,68],"all":[29],"concurrent":[30,77],"commute,":[32],"giving":[33],"state,":[38],"guaranteeing":[39],"state":[42],"at":[46],"any":[47],"quiescent":[48],"point":[49],"is":[50,83],"independent":[51],"ordering":[54],"operations.":[56],"Furthermore,":[57],"by":[58],"restricting":[59],"our":[60],"be":[64],"phase-concurrent,":[65],"we":[66,69],"show":[67],"can":[70],"support":[71],"more":[73],"efficiently":[74],"than":[75],"previous":[76],"tables.":[79],"Our":[80],"based":[84],"on":[85,90],"linear":[86],"probing,":[87],"and":[88],"relies":[89],"history-independence":[91],"for":[92],"determinism.":[93]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}