{"id":"https://openalex.org/W3000173590","doi":"https://doi.org/10.1145/3332466.3374533","title":"A supernodal all-pairs shortest path algorithm","display_name":"A supernodal all-pairs shortest path algorithm","publication_year":2020,"publication_date":"2020-02-19","ids":{"openalex":"https://openalex.org/W3000173590","doi":"https://doi.org/10.1145/3332466.3374533","mag":"3000173590"},"language":"en","primary_location":{"id":"doi:10.1145/3332466.3374533","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3332466.3374533","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374533","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374533","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048170299","display_name":"Piyush Sao","orcid":"https://orcid.org/0000-0002-9432-5855"},"institutions":[{"id":"https://openalex.org/I1289243028","display_name":"Oak Ridge National Laboratory","ror":"https://ror.org/01qz5mb56","country_code":"US","type":"facility","lineage":["https://openalex.org/I1289243028","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I4210159294"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Piyush Sao","raw_affiliation_strings":["Oak Ridge National Laboratory"],"affiliations":[{"raw_affiliation_string":"Oak Ridge National Laboratory","institution_ids":["https://openalex.org/I1289243028"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014168997","display_name":"Ramakrishnan Kannan","orcid":"https://orcid.org/0000-0002-5852-4806"},"institutions":[{"id":"https://openalex.org/I1289243028","display_name":"Oak Ridge National Laboratory","ror":"https://ror.org/01qz5mb56","country_code":"US","type":"facility","lineage":["https://openalex.org/I1289243028","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I4210159294"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramakrishnan Kannan","raw_affiliation_strings":["Oak Ridge National Laboratory"],"affiliations":[{"raw_affiliation_string":"Oak Ridge National Laboratory","institution_ids":["https://openalex.org/I1289243028"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010507285","display_name":"Prasun Gera","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasun Gera","raw_affiliation_strings":["Georgia Institute of technology"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016738770","display_name":"Richard Vuduc","orcid":"https://orcid.org/0000-0003-2178-138X"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Vuduc","raw_affiliation_strings":["Georgia Institute of technology"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of technology","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5048170299"],"corresponding_institution_ids":["https://openalex.org/I1289243028"],"apc_list":null,"apc_paid":null,"fwci":1.5557,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.82581819,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"250","last_page":"261"},"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.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7681028842926025},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.7026878595352173},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.618057370185852},{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.5678446292877197},{"id":"https://openalex.org/keywords/gaussian-elimination","display_name":"Gaussian elimination","score":0.556159496307373},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5234396457672119},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4537028968334198},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4411192536354065},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.43034979701042175},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.4228099584579468},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40815120935440063},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32050448656082153},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.13195404410362244}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7681028842926025},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.7026878595352173},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.618057370185852},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.5678446292877197},{"id":"https://openalex.org/C126312332","wikidata":"https://www.wikidata.org/wiki/Q2658","display_name":"Gaussian elimination","level":3,"score":0.556159496307373},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5234396457672119},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4537028968334198},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4411192536354065},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.43034979701042175},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.4228099584579468},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40815120935440063},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32050448656082153},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.13195404410362244},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3332466.3374533","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3332466.3374533","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374533","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:osti.gov:1648874","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1648874","pdf_url":"https://www.osti.gov/servlets/purl/1648874","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3332466.3374533","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3332466.3374533","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374533","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4865274590","display_name":null,"funder_award_id":"1710371","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320316892","display_name":"UT-Battelle","ror":"https://ror.org/04nza6677"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320338287","display_name":"Oak Ridge National Laboratory","ror":"https://ror.org/01qz5mb56"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3000173590.pdf","grobid_xml":"https://content.openalex.org/works/W3000173590.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W26556108","https://openalex.org/W625657276","https://openalex.org/W1039385342","https://openalex.org/W1480514479","https://openalex.org/W1509453182","https://openalex.org/W1526460180","https://openalex.org/W1538076361","https://openalex.org/W1539063269","https://openalex.org/W1566326249","https://openalex.org/W1572663059","https://openalex.org/W1841716671","https://openalex.org/W1880110930","https://openalex.org/W1993274656","https://openalex.org/W2014211132","https://openalex.org/W2018047324","https://openalex.org/W2022980325","https://openalex.org/W2038643780","https://openalex.org/W2039267480","https://openalex.org/W2052602889","https://openalex.org/W2058569192","https://openalex.org/W2060072995","https://openalex.org/W2063298393","https://openalex.org/W2065231486","https://openalex.org/W2067976091","https://openalex.org/W2070232376","https://openalex.org/W2073428179","https://openalex.org/W2084803275","https://openalex.org/W2089270187","https://openalex.org/W2095922668","https://openalex.org/W2102067213","https://openalex.org/W2107651134","https://openalex.org/W2117946984","https://openalex.org/W2120424341","https://openalex.org/W2127144731","https://openalex.org/W2137541800","https://openalex.org/W2170111021","https://openalex.org/W2208934446","https://openalex.org/W2271439649","https://openalex.org/W2436525433","https://openalex.org/W2494652507","https://openalex.org/W2887905332","https://openalex.org/W2898839814","https://openalex.org/W4205868507","https://openalex.org/W4231154391","https://openalex.org/W6668855946","https://openalex.org/W6694169113","https://openalex.org/W6822168629"],"related_works":["https://openalex.org/W1560134705","https://openalex.org/W2939571613","https://openalex.org/W4224251700","https://openalex.org/W2911456829","https://openalex.org/W2461439830","https://openalex.org/W3006281549","https://openalex.org/W2046489004","https://openalex.org/W2372677512","https://openalex.org/W2783028794","https://openalex.org/W2007323696"],"abstract_inverted_index":{"We":[0,124],"show":[1],"how":[2],"to":[3,29,33,81],"exploit":[4,150],"graph":[5,47],"sparsity":[6,43],"in":[7,77,128],"the":[8,12,45,74,83,156],"Floyd-Warshall":[9,18,52,88,146,157],"algorithm":[10,158,163],"for":[11,23,66,170],"all-pairs":[13],"shortest":[14],"path":[15],"(Apsp)":[16],"problem.":[17],"is":[19,48,80,136],"an":[20,129,142],"attractive":[21],"choice":[22,65],"Apsp":[24],"on":[25],"high-performing":[26],"systems":[27,37],"due":[28],"its":[30],"structural":[31],"similarity":[32],"solving":[34],"dense":[35],"linear":[36],"and":[38,58,89,92,109,121],"matrix":[39],"multiplication.":[40],"However,":[41],"if":[42],"of":[44,138,167],"input":[46,68],"not":[49,61,149],"properly":[50],"exploited,":[51],"will":[53],"perform":[54],"unnecessary":[55],"asymptotic":[56],"work":[57],"thus":[59],"may":[60],"be":[62],"a":[63],"suitable":[64],"many":[67],"graphs.":[69,174],"To":[70],"overcome":[71],"this":[72],"limitation,":[73],"key":[75],"idea":[76],"our":[78],"approach":[79],"use":[82],"known":[84],"algebraic":[85],"relationship":[86],"between":[87],"Gaussian":[90],"elimination,":[91],"import":[93],"several":[94,171],"algorithmic":[95,165],"techniques":[96,116],"from":[97],"sparse":[98,173],"Cholesky":[99],"factorization,":[100],"namely,":[101],"fill-in":[102],"reducing":[103],"ordering,":[104],"symbolic":[105],"analysis,":[106],"supernodal":[107],"traversal,":[108],"elimination":[110],"tree":[111],"parallelism.":[112,123],"When":[113],"combined,":[114],"these":[115,126],"reduce":[117],"computation,":[118],"improve":[119],"locality":[120],"enhance":[122],"implement":[125],"ideas":[127],"efficient":[130,143],"shared":[131],"memory":[132],"parallel":[133],"prototype":[134],"that":[135,147,155],"orders":[137],"magnitude":[139],"faster":[140],"than":[141],"multi-threaded":[144],"baseline":[145],"does":[148],"sparsity.":[151],"Our":[152],"experiments":[153],"suggest":[154],"can":[159],"compete":[160],"with":[161],"Dijkstra's":[162],"(the":[164],"core":[166],"Johnson's":[168],"algorithm)":[169],"classes":[172]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}