{"id":"https://openalex.org/W2150583860","doi":"https://doi.org/10.1080/10637199408915466","title":"A NEW HASHING ALGORITHM FOR PARALLEL PROCESSORS","display_name":"A NEW HASHING ALGORITHM FOR PARALLEL PROCESSORS","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2150583860","doi":"https://doi.org/10.1080/10637199408915466","mag":"2150583860"},"language":"en","primary_location":{"id":"doi:10.1080/10637199408915466","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915466","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-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/A5001945531","display_name":"Onstantinos V. Papadopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"ONSTANTINOS V. PAPADOPOULOS","raw_affiliation_strings":["Department of Electrical and Computer Engineering , Computer Science Division National Technical University of Athens , 9 Heroon Polytechneiou Zografou, Athens, GR, 1'5773, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering , Computer Science Division National Technical University of Athens , 9 Heroon Polytechneiou Zografou, Athens, GR, 1'5773, Greece","institution_ids":["https://openalex.org/I174458059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001945531"],"corresponding_institution_ids":["https://openalex.org/I174458059"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19409681,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"3-4","first_page":"223","last_page":"237"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9991000294685364,"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/T11478","display_name":"Caching and Content Delivery","score":0.9979000091552734,"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/computer-science","display_name":"Computer science","score":0.8474712371826172},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.7106753587722778},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6689368486404419},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.6348099708557129},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.5857462286949158},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.557427704334259},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5414441227912903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5371459722518921},{"id":"https://openalex.org/keywords/consistent-hashing","display_name":"Consistent hashing","score":0.5204522609710693},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5076245069503784},{"id":"https://openalex.org/keywords/linear-hashing","display_name":"Linear hashing","score":0.5068030953407288},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4513515532016754},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.43203669786453247},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.3861531615257263},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32180023193359375}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8474712371826172},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.7106753587722778},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6689368486404419},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.6348099708557129},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.5857462286949158},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.557427704334259},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5414441227912903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5371459722518921},{"id":"https://openalex.org/C56856351","wikidata":"https://www.wikidata.org/wiki/Q1757218","display_name":"Consistent hashing","level":5,"score":0.5204522609710693},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5076245069503784},{"id":"https://openalex.org/C36375716","wikidata":"https://www.wikidata.org/wiki/Q6553456","display_name":"Linear hashing","level":5,"score":0.5068030953407288},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4513515532016754},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.43203669786453247},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.3861531615257263},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32180023193359375},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199408915466","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915466","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W103797413","https://openalex.org/W1583210003","https://openalex.org/W1585070348","https://openalex.org/W1967321130","https://openalex.org/W2017948611","https://openalex.org/W2023065712","https://openalex.org/W2097452200","https://openalex.org/W2112708371","https://openalex.org/W2117578041","https://openalex.org/W2142901448","https://openalex.org/W2149644771","https://openalex.org/W2326587081","https://openalex.org/W3198160809","https://openalex.org/W4205855417"],"related_works":["https://openalex.org/W2076162755","https://openalex.org/W2334522381","https://openalex.org/W2044784665","https://openalex.org/W2084899141","https://openalex.org/W3030563642","https://openalex.org/W2008682098","https://openalex.org/W2000284985","https://openalex.org/W2094127768","https://openalex.org/W2105130984","https://openalex.org/W4281890709"],"abstract_inverted_index":{"Abstract":[0],"Hashing":[1],"techniques":[2],"have":[3,20,39,59],"long":[4],"been":[5,21,61,171],"used":[6],"to":[7,75,194,218,247,270,294],"efficiently":[8],"store":[9],"and":[10,105,131,214,235],"locate":[11],"data":[12,222,256],"indexed":[13],"by":[14,245,263],"key.":[15],"Recently,":[16],"parallel":[17,33,69,103,112,143,149,168,178,279,299],"hashing":[18,70,118,144,169,212],"algorithms":[19,38,58,113,190,213,229],"developed":[22],"that":[23,72,95,207,239,258,285],"allow":[24],"table":[25],"insertion":[26],"of":[27,36,45,51,91,117,167,177,182,188,198,227,250,273],"many":[28,193],"keys":[29],"in":[30,174],"a":[31,55,68,120,138,180,248],"few":[32],"steps/The":[34],"analyses":[35],"these":[37,57],"focused":[40],"on":[41,204,230,252,298],"the":[42,161,165,175,185,196,205,231,259,264,271,278],"expected":[43,102,109,186],"number":[44],"steps":[46,104],"required,":[47],"ignoring":[48],"the-":[49],"issue":[50],"work":[52,62,77,84,110,274,286],"complexity.":[53],"As":[54],"result,":[56],"not":[60],"efficient.":[63],"In":[64],"this":[65],"paper,":[66],"represent":[67],"algorithm":[71,265],"is":[73,145,241,266,288],"shown":[74],"be":[76,135,156,209],"efficient":[78],"because":[79],"it":[80,96,240],"performs":[81,97],"no":[82],"more":[83,267],"than":[85,243,277],"its":[86,92],"serial":[87],"counterpart.":[88],"An":[89],"analysis":[90],"behavior":[93],"shows":[94],"S":[98],"=":[99],"O":[100],"(logn)":[101],"W":[106],"-":[107],"O(n)":[108],"Many":[111],"can":[114,134],"make":[115],"use":[116,166,197,220],"as":[119,125,160],"core":[121,162],"step.":[122,163],"Procedures":[123],"such":[124,189],"histogramming,":[126],"set":[127],"difference,":[128],"keyed":[129],"reduction":[130],"dictionary":[132],"lookup":[133],"formulated":[136],"using":[137,158],"general":[139],"hash":[140],"routine.":[141],"Thus,":[142],"an":[146,225,289],"important":[147,290],"fundamental":[148],"operation.":[150],"The":[151],"above":[152],"applications":[153],"may":[154,208],"also":[155],"implemented":[157],"sorting":[159,244],"While":[164],"has":[170,191],"generally":[172],"accepted":[173],"folklore":[176],"computing,":[179],"dearth":[181],"literature":[183],"about":[184],"performance":[187,206,297],"led":[192],"favor":[195],"sorting.":[199],"This":[200],"paper":[201],"sheds":[202],"light":[203],"achieved":[210],"using.parallel":[211],"should":[215],"lend":[216],"credibility":[217],"their":[219],"Performance":[221],"collected":[223],"from":[224],"implementation":[226],"our":[228],"Connection":[232],"Machine":[233],"CM-2":[234],"CRAY":[236],"Y-MP":[237],"show":[238,257],"faster":[242],"up":[246],"factor":[249],"four":[251],"both":[253],"machines.":[254,300],"These":[255],"total":[260],"time":[261],"required":[262],"closely":[268],"related":[269],"amount":[272],"performed,":[275],"rather":[276],"step":[280],"count.":[281],"Our":[282],"results":[283],"indicate":[284],"efficiency":[287],"consideration":[291],"when":[292],"trying":[293],"achieve":[295],"high":[296]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}