{"id":"https://openalex.org/W2558631043","doi":"https://doi.org/10.1109/tpds.2016.2634535","title":"Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems","display_name":"Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2558631043","doi":"https://doi.org/10.1109/tpds.2016.2634535","mag":"2558631043"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2016.2634535","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2016.2634535","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"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 Parallel and Distributed Systems","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/A5008813690","display_name":"Venkatesan T. Chakaravarthy","orcid":"https://orcid.org/0000-0002-9422-7243"},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Venkatesan T. Chakaravarthy","raw_affiliation_strings":["IBM Research, Vasant Kunj, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research, Vasant Kunj, New Delhi, India","institution_ids":["https://openalex.org/I4210103279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047885427","display_name":"Fabio Checconi","orcid":"https://orcid.org/0000-0002-7279-8459"},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fabio Checconi","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, Yorktown Heights, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036823591","display_name":"Prakash Murali","orcid":"https://orcid.org/0000-0003-3378-8589"},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prakash Murali","raw_affiliation_strings":["IBM Research, Vasant Kunj, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research, Vasant Kunj, New Delhi, India","institution_ids":["https://openalex.org/I4210103279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066195314","display_name":"Fabrizio Petrini","orcid":"https://orcid.org/0000-0002-4977-7107"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fabrizio Petrini","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, Yorktown Heights, NY","Intel Parallel Computing Labs, Santa Clara, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"Intel Parallel Computing Labs, Santa Clara, CA","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033885850","display_name":"Yogish Sabharwal","orcid":"https://orcid.org/0009-0002-5053-2059"},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Yogish Sabharwal","raw_affiliation_strings":["IBM Research, Vasant Kunj, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research, Vasant Kunj, New Delhi, India","institution_ids":["https://openalex.org/I4210103279"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2424,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.9456022,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"28","issue":"7","first_page":"2031","last_page":"2045"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9966999888420105,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6403594017028809},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.5985645055770874},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5708262324333191},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5298673510551453},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4959815442562103},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.45145687460899353},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4508683979511261},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4124159812927246},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41013988852500916},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.376526415348053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36821091175079346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3337883949279785}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6403594017028809},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.5985645055770874},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5708262324333191},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5298673510551453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4959815442562103},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.45145687460899353},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4508683979511261},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4124159812927246},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41013988852500916},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.376526415348053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36821091175079346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3337883949279785},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tpds.2016.2634535","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2016.2634535","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"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 Parallel and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G102163711","display_name":null,"funder_award_id":"DE\u2010 AC02\u201006CH11357","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"}],"funders":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"},{"id":"https://openalex.org/F4320338284","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W140737195","https://openalex.org/W1482680420","https://openalex.org/W1504291959","https://openalex.org/W1561240874","https://openalex.org/W1971937094","https://openalex.org/W1987117608","https://openalex.org/W1992011279","https://openalex.org/W1999545213","https://openalex.org/W2009852231","https://openalex.org/W2033740214","https://openalex.org/W2034297532","https://openalex.org/W2051109346","https://openalex.org/W2057112598","https://openalex.org/W2061159212","https://openalex.org/W2063301486","https://openalex.org/W2082473446","https://openalex.org/W2084224084","https://openalex.org/W2095677000","https://openalex.org/W2110326711","https://openalex.org/W2112681514","https://openalex.org/W2125895010","https://openalex.org/W2130488390","https://openalex.org/W2139645669","https://openalex.org/W2144085134","https://openalex.org/W2148831787","https://openalex.org/W2150898004","https://openalex.org/W2165301438","https://openalex.org/W2166837162","https://openalex.org/W2169528473","https://openalex.org/W2171707538","https://openalex.org/W2227557434","https://openalex.org/W2340006107","https://openalex.org/W2573366627","https://openalex.org/W3004555699","https://openalex.org/W4230357857","https://openalex.org/W4253426709","https://openalex.org/W4285719527","https://openalex.org/W6603201521","https://openalex.org/W6677111876","https://openalex.org/W6731827760"],"related_works":["https://openalex.org/W2504004674","https://openalex.org/W1595229445","https://openalex.org/W2498744856","https://openalex.org/W4390482104","https://openalex.org/W322408318","https://openalex.org/W149041114","https://openalex.org/W2963177394","https://openalex.org/W1965815883","https://openalex.org/W763418848","https://openalex.org/W2732982824"],"abstract_inverted_index":{"We":[0,44],"consider":[1],"the":[2,21,39,87,121],"single-source":[3],"shortest":[4,22],"path":[5],"(SSSP)":[6],"problem:":[7],"given":[8],"an":[9,91],"undirected":[10],"graph":[11,93],"with":[12],"integer":[13],"edge":[14,51],"weights":[15],"and":[16,41,53,61],"a":[17,33,104,114],"source":[18],"vertex$v$,":[19],"find":[20],"paths":[23],"from$v$to":[24],"all":[25],"other":[26],"vertices.":[27,70],"In":[28,86],"this":[29],"paper,":[30],"we":[31,62,101],"introduce":[32],"novel":[34],"parallel":[35],"algorithm,":[36],"derived":[37],"from":[38],"Bellman-Ford":[40],"Delta-stepping":[42],"algorithms.":[43],"employ":[45],"various":[46],"pruning":[47],"techniques,":[48],"such":[49],"as":[50,79],"classification":[52],"direction-optimization,":[54],"to":[55,67],"dramatically":[56],"reduce":[57],"inter-node":[58],"communication":[59],"traffic,":[60],"propose":[63],"load":[64],"balancing":[65],"strategies":[66],"handle":[68],"higher-degree":[69],"These":[71],"techniques":[72],"are":[73],"particularly":[74],"effective":[75],"on":[76,96],"power-law":[77],"graphs,":[78],"demonstrated":[80],"by":[81],"our":[82],"extensive":[83],"performance":[84],"analysis.":[85],"largest":[88],"tested":[89],"configuration,":[90],"R-MAT":[92],"with$2^{38}$vertices":[94],"and$2^{42}$edges":[95],"32,768":[97],"Blue":[98],"Gene/Q":[99],"nodes,":[100],"have":[102],"achieved":[103],"processing":[105],"rate":[106],"of":[107,117],"three":[108],"Trillion":[109],"Edges":[110],"Per":[111],"Second":[112],"(TTEPS),":[113],"four":[115],"orders":[116],"magnitude":[118],"improvement":[119],"over":[120],"best":[122],"published":[123],"results.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}