{"id":"https://openalex.org/W109582950","doi":null,"title":"Accelerating graph algorithms with priority queue processor","display_name":"Accelerating graph algorithms with priority queue processor","alternate_titles":[],"publication_year":2006,"publication_date":"2006-07-26","ids":{"openalex":"https://openalex.org/W109582950","mag":"109582950"},"language":"en","primary_location":{"id":"mag:109582950","doi":null,"is_oa":false,"landing_page_url":"http://eprints.utm.my/id/eprint/1689/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W109582950"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5029423749","display_name":"Ch\u00edng Heng Sun","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Ch\u00edng Heng Sun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020794595","display_name":"Chew Eik Wee","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Chew Eik Wee","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003412180","display_name":"Nasir Shaikh-Husin","orcid":"https://orcid.org/0000-0001-8115-1270","observed_orcids":["https://orcid.org/0000-0001-8115-1270"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Nasir Shaikh-Husin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109271897","display_name":"Mohamed Khalil Hani","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Mohamed Khalil Hani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.47269999980926514,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.47269999980926514,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.461899995803833,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.026799999177455902,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.8270000219345093},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9829999804496765},{"id":"https://openalex.org/keywords/graph-search","display_name":"graph search","score":0.7400000095367432},{"id":"https://openalex.org/keywords/hardware-software-co-design","display_name":"hardware-software co-design","score":0.8899999856948853},{"id":"https://openalex.org/keywords/embedded-systems","display_name":"embedded systems","score":0.8600000143051147},{"id":"https://openalex.org/keywords/algorithm-acceleration","display_name":"algorithm acceleration","score":0.6940000057220459},{"id":"https://openalex.org/keywords/runtime-complexity","display_name":"runtime complexity","score":0.7059999704360962}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8131448030471802},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.7880675792694092},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7529828548431396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5536738038063049},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4504033029079437},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.43132826685905457},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4032689332962036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39431461691856384},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.169693261384964},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14717194437980652}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:109582950","doi":null,"is_oa":false,"landing_page_url":"http://eprints.utm.my/id/eprint/1689/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2115903503","https://openalex.org/W2117630007","https://openalex.org/W2135057242","https://openalex.org/W2161420356","https://openalex.org/W2169660606"],"related_works":["https://openalex.org/W7099027093","https://openalex.org/W2970418136","https://openalex.org/W954744949","https://openalex.org/W7099617421","https://openalex.org/W4414036622","https://openalex.org/W7097218131","https://openalex.org/W7214758132","https://openalex.org/W7097565423","https://openalex.org/W1511157773","https://openalex.org/W2089026470"],"abstract_inverted_index":{"Graphs":[0],"are":[1,14,28,37],"a":[2,26,51,78],"pervasive":[3],"data":[4],"structure":[5],"in":[6,147],"computer":[7],"science,":[8],"and":[9,63,74,134],"algorithms":[10,36,90,107],"working":[11],"with":[12,152],"them":[13],"fundamental":[15],"to":[16,57,87,150],"the\r\nfield.":[17],"Of":[18],"the":[19,29,48,59,72,100,112,135],"various":[20],"graph":[21,27,32,35,44,79,89,106],"algorithms,":[22],"techniques":[23],"for":[24],"searching":[25,45,49],"heart":[30,113],"of":[31,42,50,65,77,114,138],"algorithms.":[33,46],"Many":[34],"organized":[38],"as":[39,99,103],"simple":[40],"elaborations":[41],"basic":[43],"For":[47],"graph,":[52],"Priority":[53],"Queue":[54],"is":[55,97,141],"used":[56],"maintain":[58],"tentative":[60],"search":[61],"result":[62],"choice":[64],"priority":[66,92,126,154],"queue":[67,93,127,155],"implementation":[68,149],"would":[69],"significantly":[70],"affect":[71],"run-time":[73,136],"memory":[75],"consumption":[76],"algorithm.":[80],"In":[81],"this":[82],"work,":[83],"we":[84],"demonstrate":[85],"how":[86],"accelerate":[88],"using":[91],"processor.":[94,156],"Dijkstra\u00c2\u2019s":[95,109,139],"algorithm":[96,110,140],"chosen":[98],"target":[101],"implementation,":[102,133],"many":[104],"state-of-the-art":[105],"use":[108],"at":[111],"their":[115],"computational":[116],"engine.":[117],"Assuming":[118],"embedded":[119],"hardware-software":[120],"codesign,":[121],"results":[122],"show":[123],"that":[124],"our":[125,153],"processor":[128],"performs":[129],"better":[130],"than":[131],"software":[132,148],"complexity":[137],"reduced":[142],"from":[143],"O(n":[144],"lg":[145],"n)":[146],"O(n)":[151]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W109582950","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
