{"id":"https://openalex.org/W4387918043","doi":"https://doi.org/10.1109/tce.2023.3327328","title":"Efficient Parallel Processing of All-Pairs Shortest Paths on Multicore and GPU Systems","display_name":"Efficient Parallel Processing of All-Pairs Shortest Paths on Multicore and GPU Systems","publication_year":2023,"publication_date":"2023-10-24","ids":{"openalex":"https://openalex.org/W4387918043","doi":"https://doi.org/10.1109/tce.2023.3327328"},"language":"en","primary_location":{"id":"doi:10.1109/tce.2023.3327328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tce.2023.3327328","pdf_url":null,"source":{"id":"https://openalex.org/S126824455","display_name":"IEEE Transactions on Consumer Electronics","issn_l":"0098-3063","issn":["0098-3063","1558-4127"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Consumer Electronics","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/A5057472157","display_name":"Mohammed Alghamdi","orcid":"https://orcid.org/0000-0002-5042-0690"},"institutions":[{"id":"https://openalex.org/I4210099699","display_name":"University of Jeddah","ror":"https://ror.org/015ya8798","country_code":"SA","type":"education","lineage":["https://openalex.org/I4210099699"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Mohammed H. Alghamdi","raw_affiliation_strings":["Department of Information and Technology Systems, College of Computer Science and Engineering, University of Jeddah, Jeddah, Saudi Arabia"],"raw_orcid":"https://orcid.org/0000-0002-5042-0690","affiliations":[{"raw_affiliation_string":"Department of Information and Technology Systems, College of Computer Science and Engineering, University of Jeddah, Jeddah, Saudi Arabia","institution_ids":["https://openalex.org/I4210099699"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064596191","display_name":"Ligang He","orcid":"https://orcid.org/0000-0002-5671-0576"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ligang He","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, U.K"],"raw_orcid":"https://orcid.org/0000-0002-5671-0576","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, U.K","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113345812","display_name":"Shenyuan Ren","orcid":"https://orcid.org/0009-0006-6824-8856"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]},{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["CN","GB"],"is_corresponding":false,"raw_author_name":"Shenyuan Ren","raw_affiliation_strings":["Computer Science Department, Beijing Jiaotong University, Beijing, China","Visiting Scientist, Clarendon Laboratory, Department of Physics, University of Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Beijing Jiaotong University, Beijing, China","institution_ids":["https://openalex.org/I21193070"]},{"raw_affiliation_string":"Visiting Scientist, Clarendon Laboratory, Department of Physics, University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030631880","display_name":"Mohammed Maray","orcid":"https://orcid.org/0000-0002-7066-2945"},"institutions":[{"id":"https://openalex.org/I82952536","display_name":"King Khalid University","ror":"https://ror.org/052kwzs30","country_code":"SA","type":"education","lineage":["https://openalex.org/I82952536"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Mohammed Maray","raw_affiliation_strings":["College of Computer Science and Information Systems, King Khalid University, Abha, Saudi Arabia"],"raw_orcid":"https://orcid.org/0000-0002-7066-2945","affiliations":[{"raw_affiliation_string":"College of Computer Science and Information Systems, King Khalid University, Abha, Saudi Arabia","institution_ids":["https://openalex.org/I82952536"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2871,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.50773532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"70","issue":"1","first_page":"2896","last_page":"2908"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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/multi-core-processor","display_name":"Multi-core processor","score":0.7204337120056152},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7055063247680664},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6788092851638794},{"id":"https://openalex.org/keywords/parallel-processing","display_name":"Parallel processing","score":0.5498018264770508},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4218941926956177},{"id":"https://openalex.org/keywords/general-purpose-computing-on-graphics-processing-units","display_name":"General-purpose computing on graphics processing units","score":0.4157865047454834},{"id":"https://openalex.org/keywords/computational-science","display_name":"Computational science","score":0.3640652298927307},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.23384013772010803},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.23040491342544556},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19999083876609802}],"concepts":[{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.7204337120056152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7055063247680664},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6788092851638794},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.5498018264770508},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4218941926956177},{"id":"https://openalex.org/C50630238","wikidata":"https://www.wikidata.org/wiki/Q971505","display_name":"General-purpose computing on graphics processing units","level":3,"score":0.4157865047454834},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.3640652298927307},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.23384013772010803},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.23040491342544556},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19999083876609802},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tce.2023.3327328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tce.2023.3327328","pdf_url":null,"source":{"id":"https://openalex.org/S126824455","display_name":"IEEE Transactions on Consumer Electronics","issn_l":"0098-3063","issn":["0098-3063","1558-4127"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Consumer Electronics","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:180637","is_oa":false,"landing_page_url":"https://wrap.warwick.ac.uk/180637/1/WRAP-efficient-parallel-processing-all-pairs-shortest-paths-multicore-GPU-systems-He-2023.pdf","pdf_url":"https://wrap.warwick.ac.uk/180637/1/WRAP-efficient-parallel-processing-all-pairs-shortest-paths-multicore-GPU-systems-He-2023.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.550000011920929,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1595498733","https://openalex.org/W1983275606","https://openalex.org/W2007572995","https://openalex.org/W2018658595","https://openalex.org/W2022980325","https://openalex.org/W2036679956","https://openalex.org/W2113079303","https://openalex.org/W2154111453","https://openalex.org/W2169528473","https://openalex.org/W2219764230","https://openalex.org/W2244852567","https://openalex.org/W2294347342","https://openalex.org/W2755088640","https://openalex.org/W2885459432","https://openalex.org/W2895821746","https://openalex.org/W2995145112","https://openalex.org/W2999349723","https://openalex.org/W3000173590","https://openalex.org/W4246219036","https://openalex.org/W4246906001","https://openalex.org/W6684549237","https://openalex.org/W6981061819"],"related_works":["https://openalex.org/W2505380084","https://openalex.org/W1656096860","https://openalex.org/W2095928260","https://openalex.org/W1971268154","https://openalex.org/W2268149564","https://openalex.org/W1984739956","https://openalex.org/W2763312740","https://openalex.org/W2395407252","https://openalex.org/W2172097233","https://openalex.org/W3141649919"],"abstract_inverted_index":{"Finding":[0],"the":[1,13,57,73,91,110,117,127,132,142,152,162,171,179,186,189,201,215,219],"shortest":[2,105],"path":[3,106],"between":[4],"any":[5,103],"two":[6],"nodes":[7],"in":[8,22,31,35,100,120,185,200],"a":[9,19,68,84],"graph,":[10],"known":[11],"as":[12,28,42,44,109],"All-Pairs":[14],"Shortest":[15],"Paths":[16],"(APSP),":[17],"is":[18,86,98,176],"fundamental":[20],"problem":[21,75],"many":[23],"data":[24,45],"analysis":[25,46],"problems,":[26],"such":[27,108],"supply":[29],"chains":[30],"logistics,":[32],"routing":[33],"protocols":[34],"IoT":[36],"networks":[37],"that":[38,211],"involve":[39],"consumer":[40],"electronics":[41],"well":[43],"for":[47,131],"social":[48],"networking":[49],"apps":[50,54],"and":[51,78,136,147,158,206],"Google":[52],"Maps":[53],"used":[55,139],"by":[56,89],"general":[58],"public":[59],"on":[60,76,144,161],"their":[61],"smartphones.":[62],"In":[63,81,188],"this":[64],"work,":[65],"we":[66,191],"present":[67],"novel":[69],"approach":[70],"to":[71,125,140,223],"solve":[72],"APSP":[74,130,198],"multicore":[77,145],"GPU":[79],"systems.":[80],"our":[82,193,212],"approach,":[83],"graph":[85,92],"first":[87],"pre-processed":[88],"partitioning":[90],"into":[93],"sub-graphs.":[94],"Then,":[95],"each":[96],"sub-graph":[97],"processed":[99],"parallel":[101],"using":[102],"existing":[104,197,216],"algorithm":[107,112],"Floyd-Warshall":[111],"or":[113],"Dijkstra\u2019s":[114],"algorithm.":[115],"Finally,":[116],"distance":[118],"results":[119,209],"individual":[121],"sub-graphs":[122],"are":[123,138],"aggregated":[124],"obtain":[126],"distances":[128],"of":[129,173,178,221],"entire":[133],"graph.":[134],"OpenMP":[135],"CUDA":[137],"implement":[141],"parallelization":[143],"CPUs":[146],"GPUs,":[148],"respectively.":[149],"We":[150],"conduct":[151],"extensive":[153],"experiments":[154],"with":[155,195],"both":[156],"synthetic":[157],"real-world":[159],"graphs":[160],"JADE":[163],"(Joint":[164],"Academic":[165],"Data":[166],"Science":[167],"Endeavour)":[168],"cluster":[169],"at":[170],"University":[172],"Oxford,":[174],"which":[175],"part":[177],"Tier-2":[180],"high":[181],"performance":[182],"computing":[183],"facilities":[184],"UK.":[187],"experiments,":[190],"compared":[192],"methods":[194,213],"three":[196],"algorithms":[199],"literature,":[202],"including":[203],"n-Dijkstra,":[204],"ParAPSP":[205],"SuperFW.":[207],"The":[208],"show":[210],"outperform":[214],"algorithms,":[217],"achieving":[218],"speedup":[220],"up":[222],"8.3x":[224],"over":[225],"Dijkstra.":[226]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}