{"id":"https://openalex.org/W3201761987","doi":"https://doi.org/10.1145/3472456.3472524","title":"Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs","display_name":"Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs","publication_year":2021,"publication_date":"2021-08-09","ids":{"openalex":"https://openalex.org/W3201761987","doi":"https://doi.org/10.1145/3472456.3472524","mag":"3201761987"},"language":"en","primary_location":{"id":"doi:10.1145/3472456.3472524","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3472456.3472524","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"50th International Conference on Parallel Processing","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/A5068722465","display_name":"Lin Zhu","orcid":"https://orcid.org/0000-0002-0402-1648"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lin Zhu","raw_affiliation_strings":["Huazhong University of Science and Technology, China"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060679441","display_name":"Qiang-Sheng Hua","orcid":"https://orcid.org/0000-0002-3909-5719"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiang-Sheng Hua","raw_affiliation_strings":["Huazhong University of Science and Technology, China"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022262922","display_name":"Hai Jin","orcid":"https://orcid.org/0000-0002-3934-7605"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hai Jin","raw_affiliation_strings":["Huazhong University of Science and Technology, China"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology, China","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068722465"],"corresponding_institution_ids":["https://openalex.org/I47720641"],"apc_list":null,"apc_paid":null,"fwci":0.1003,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.43487043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6899167895317078},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5310384035110474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35675671696662903}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6899167895317078},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5310384035110474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35675671696662903}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3472456.3472524","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3472456.3472524","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"50th International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G937571744","display_name":null,"funder_award_id":"61972447","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W127166643","https://openalex.org/W1655990431","https://openalex.org/W1972501001","https://openalex.org/W2007572995","https://openalex.org/W2010747199","https://openalex.org/W2014211132","https://openalex.org/W2022980325","https://openalex.org/W2032839380","https://openalex.org/W2034896421","https://openalex.org/W2070232376","https://openalex.org/W2099611016","https://openalex.org/W2104373803","https://openalex.org/W2104734478","https://openalex.org/W2107651134","https://openalex.org/W2127144731","https://openalex.org/W2137541800","https://openalex.org/W2139316564","https://openalex.org/W2141331848","https://openalex.org/W2143131337","https://openalex.org/W2157323434","https://openalex.org/W2168748809","https://openalex.org/W2298920323","https://openalex.org/W2887905332","https://openalex.org/W3000173590","https://openalex.org/W3009233884","https://openalex.org/W3100417409","https://openalex.org/W4231154391","https://openalex.org/W4256464778"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,30,54,72],"propose":[4],"a":[5,74,106,146,156],"parallel":[6],"algorithm":[7,97,140,194],"for":[8,14,64,126,159,174],"computing":[9,175],"all-pairs":[10],"shortest":[11],"paths":[12],"(APSP)":[13],"sparse":[15,160,178],"graphs":[16,128,161],"on":[17,59,177],"the":[18,27,33,56,60,80,89,112,123,130,142,152,167,189,199],"distributed":[19,61],"memory":[20,62],"system":[21,63],"with":[22,122,162],"p":[23],"processors.":[24],"To":[25],"exploit":[26],"graph":[28,34,58,113],"sparsity,":[29],"first":[31],"preprocess":[32],"by":[35,145,155],"utilizing":[36],"several":[37],"known":[38],"algorithmic":[39],"techniques":[40],"in":[41],"linear":[42],"algebra":[43],"such":[44],"as":[45],"fill-in":[46],"reducing":[47],"ordering":[48],"and":[49,68,88,99,132,136,150,169,182,198],"elimination":[50],"tree":[51],"parallelism.":[52],"Then":[53],"map":[55],"preprocessed":[57],"both":[65],"load":[66],"balancing":[67],"communication":[69,81],"reduction.":[70],"Finally,":[71],"design":[73],"new":[75],"scheduling":[76],"strategy":[77],"to":[78],"minimize":[79],"cost.":[82],"The":[83],"bandwidth":[84,131,153,168,190],"cost":[85,91,144,154,191,201],"(communication":[86],"volume)":[87],"latency":[90,133,143,170,200],"(number":[92],"of":[93,95,117,148,158,192],"messages)":[94],"our":[96,139,193],"are":[98,135,181],"O(log":[100],"2p),":[101,184],"respectively,":[102,138],"where":[103,129],"S":[104],"is":[105,195,202],"minimal":[107],"vertex":[108],"separator":[109],"that":[110,188],"partitions":[111],"into":[114],"two":[115],"components":[116],"roughly":[118],"equal":[119],"size.":[120],"Compared":[121],"state-of-the-art":[124],"result":[125],"dense":[127],"costs":[134,171],"),":[137],"reduces":[141,151],"factor":[147,157],",":[149],".":[163],"We":[164],"also":[165],"present":[166],"lower":[172],"bounds":[173],"APSP":[176],"graphs,":[179],"which":[180],"\u03a9(log":[183],"respectively.":[185],"This":[186],"implies":[187],"nearly":[196],"optimal":[197],"optimal.":[203]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}