{"id":"https://openalex.org/W2090121768","doi":"https://doi.org/10.4304/jnw.8.12.2797-2803","title":"All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model","display_name":"All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model","publication_year":2013,"publication_date":"2013-12-10","ids":{"openalex":"https://openalex.org/W2090121768","doi":"https://doi.org/10.4304/jnw.8.12.2797-2803","mag":"2090121768"},"language":"en","primary_location":{"id":"doi:10.4304/jnw.8.12.2797-2803","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jnw.8.12.2797-2803","pdf_url":null,"source":{"id":"https://openalex.org/S189188848","display_name":"Journal of Networks","issn_l":"1796-2056","issn":["1796-2056"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Networks","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/A5111620410","display_name":"Qingshuang Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qingshuang Wu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052964725","display_name":"Chunya Tong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chunya Tong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018867983","display_name":"Qiang Wang","orcid":"https://orcid.org/0000-0002-2986-967X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qiang Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5052085597","display_name":"Xiangfu Cheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiangfu Cheng","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.6349,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.69925342,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"12","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9954000115394592,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9344727396965027},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.8733891248703003},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7032533884048462},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5959069132804871},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5036267638206482},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3287363052368164},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.252878874540329},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1726907193660736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09054285287857056}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9344727396965027},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.8733891248703003},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7032533884048462},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5959069132804871},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5036267638206482},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3287363052368164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.252878874540329},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1726907193660736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09054285287857056}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jnw.8.12.2797-2803","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jnw.8.12.2797-2803","pdf_url":null,"source":{"id":"https://openalex.org/S189188848","display_name":"Journal of Networks","issn_l":"1796-2056","issn":["1796-2056"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1541331569","https://openalex.org/W1549830275","https://openalex.org/W1555415011","https://openalex.org/W1564268483","https://openalex.org/W1969768839","https://openalex.org/W1980153429","https://openalex.org/W1982825626","https://openalex.org/W1994061133","https://openalex.org/W2003969379","https://openalex.org/W2027230861","https://openalex.org/W2028499920","https://openalex.org/W2028689383","https://openalex.org/W2037981635","https://openalex.org/W2045801381","https://openalex.org/W2057112598","https://openalex.org/W2057630513","https://openalex.org/W2063395455","https://openalex.org/W2068023969","https://openalex.org/W2072020906","https://openalex.org/W2081612620","https://openalex.org/W2091359539","https://openalex.org/W2107888072","https://openalex.org/W2132536544","https://openalex.org/W2150898004","https://openalex.org/W2165831368","https://openalex.org/W2166149818","https://openalex.org/W2169528473","https://openalex.org/W2295862081","https://openalex.org/W3026008916","https://openalex.org/W3122189187","https://openalex.org/W3125465694","https://openalex.org/W4251332127","https://openalex.org/W6633909495"],"related_works":["https://openalex.org/W2011840458","https://openalex.org/W3213381848","https://openalex.org/W2017587301","https://openalex.org/W2005148983","https://openalex.org/W2030707850","https://openalex.org/W4386975487","https://openalex.org/W2096672917","https://openalex.org/W2009169896","https://openalex.org/W2392023973","https://openalex.org/W2939411666"],"abstract_inverted_index":{"In":[0,90,115],"view":[1],"of":[2,35,57,62,78,96,111,121,152,157,166,187,190],"the":[3,19,25,33,58,63,69,76,91,97,108,112,116,122,144,153,158,185],"problem":[4],"that":[5,22,143],"computing":[6,28,60,106,133,155,174],"shortest":[7,45,193],"paths":[8,46],"in":[9,38,134],"a":[10,13,103,128],"graph":[11],"is":[12,181],"complex":[14],"and":[15,18,80,84,161,177,179],"time-consuming":[16],"process,":[17],"traditional":[20],"algorithm":[21,47,73,147,171],"rely":[23],"on":[24],"CPU":[26],"as":[27],"unit":[29],"solely":[30],"can't":[31],"meet":[32,184],"demand":[34,186],"real-time":[36,188],"processing,":[37],"this":[39],"paper,":[40],"we":[41,93,118],"present":[42],"an":[43],"all-pairs":[44],"using":[48],"MPI+CUDA":[49],"hybrid":[50],"programming":[51,82,99,124],"model,":[52,83],"which":[53],"can":[54,74,85,148,162],"take":[55,94,119,149],"use":[56,95,120],"overwhelming":[59],"power":[61],"GPU":[64,113,159],"cluster":[65],"to":[66,101,126,183],"speed":[67],"up":[68],"processing.":[70],"This":[71],"proposed":[72],"combine":[75],"advantages":[77],"MPI":[79,98],"CUDA":[81,123],"realize":[86],"two-level":[87],"parallel":[88,105,132,146],"computing.":[89],"cluster-level,":[92],"model":[100,125],"achieve":[102,127,163],"coarse-grained":[104],"between":[107],"computational":[109,136],"nodes":[110],"cluster.":[114],"node-level,":[117],"GPU-accelerated":[129],"fine":[130],"grit":[131],"each":[135],"node":[137],"internal.":[138],"The":[139,169],"experimental":[140],"results":[141],"show":[142],"MPI+CUDA-based":[145],"full":[150],"advantage":[151],"powerful":[154],"capability":[156],"cluster,":[160],"about":[164],"hundreds":[165],"time":[167],"speedup;":[168],"whole":[170],"has":[172],"good":[173],"performance,":[175],"reliability":[176],"scalability,":[178],"it":[180],"able":[182],"processing":[189],"massive":[191],"spatial":[192],"path":[194],"analysis":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}