{"id":"https://openalex.org/W2502734103","doi":"https://doi.org/10.1109/tpds.2015.2485994","title":"An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures","display_name":"An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures","publication_year":2015,"publication_date":"2015-10-02","ids":{"openalex":"https://openalex.org/W2502734103","doi":"https://doi.org/10.1109/tpds.2015.2485994","mag":"2502734103"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2015.2485994","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2015.2485994","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/A5053217543","display_name":"Federico Busato","orcid":null},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"education","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Federico Busato","raw_affiliation_strings":["Department of Computer Science, University of Verona, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Verona, Italy","institution_ids":["https://openalex.org/I119439378"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088231786","display_name":"Nicola Bombieri","orcid":"https://orcid.org/0000-0003-3256-5885"},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"education","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Bombieri","raw_affiliation_strings":["Department of Computer Science, University of Verona, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Verona, Italy","institution_ids":["https://openalex.org/I119439378"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053217543"],"corresponding_institution_ids":["https://openalex.org/I119439378"],"apc_list":null,"apc_paid":null,"fwci":4.0501,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.96065458,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"27","issue":"8","first_page":"2222","last_page":"2233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8335169553756714},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7195866703987122},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6835343837738037},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6834821701049805},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.649265706539154},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6077854633331299},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.4762665927410126},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42618608474731445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4256500005722046},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3372589647769928}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8335169553756714},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7195866703987122},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6835343837738037},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6834821701049805},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.649265706539154},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6077854633331299},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.4762665927410126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42618608474731445},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4256500005722046},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3372589647769928},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tpds.2015.2485994","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2015.2485994","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":[{"score":0.5699999928474426,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1487977379","https://openalex.org/W1504291959","https://openalex.org/W1572663059","https://openalex.org/W1638786232","https://openalex.org/W1770249075","https://openalex.org/W1964416868","https://openalex.org/W1985291160","https://openalex.org/W1997162567","https://openalex.org/W2000041758","https://openalex.org/W2016490257","https://openalex.org/W2026899497","https://openalex.org/W2033597569","https://openalex.org/W2035080386","https://openalex.org/W2057112598","https://openalex.org/W2066133878","https://openalex.org/W2085237698","https://openalex.org/W2085248745","https://openalex.org/W2085449715","https://openalex.org/W2100586428","https://openalex.org/W2107173440","https://openalex.org/W2109473404","https://openalex.org/W2129666400","https://openalex.org/W2139559590","https://openalex.org/W2145544674","https://openalex.org/W2169528473","https://openalex.org/W2170616854","https://openalex.org/W2227557434","https://openalex.org/W2469279958","https://openalex.org/W2573366627","https://openalex.org/W3137299218","https://openalex.org/W3145128584","https://openalex.org/W4234988573","https://openalex.org/W4246219036","https://openalex.org/W6671868814","https://openalex.org/W6731827760"],"related_works":["https://openalex.org/W1500978221","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W2990531685","https://openalex.org/W4310124294"],"abstract_inverted_index":{"Finding":[0],"the":[1,23,44,52,86,91,115,122,126,133,147,181,186],"shortest":[2,30],"paths":[3],"from":[4],"a":[5,13,28,73,82],"single":[6],"source":[7],"to":[8,37,60,102,114,121,125],"all":[9],"other":[10],"vertices":[11],"is":[12,22,49],"common":[14],"problem":[15,33],"in":[16,63],"graph":[17],"analysis.":[18],"The":[19,109,128],"Bellman-Ford's":[20],"algorithm":[21,88,123],"solution":[24],"that":[25,89,132,155,177],"solves":[26],"such":[27],"single-source":[29],"path":[31],"(SSSP)":[32],"and":[34,72,106,124,176],"better":[35],"applies":[36],"be":[38],"parallelized":[39],"for":[40,153],"many-core":[41],"architectures.":[42],"Nevertheless,":[43],"high":[45],"degree":[46],"of":[47,54,76,85,94,140],"parallelism":[48],"guaranteed":[50],"at":[51],"cost":[53],"low":[55],"work":[56,71,107,164,183],"efficiency,":[57],"which,":[58],"compared":[59],"similar":[61],"algorithms":[62],"literature":[64],"(e.g.,":[65,168],"Dijkstra's)":[66],"involves":[67],"much":[68],"more":[69],"redundant":[70,182],"consequent":[74],"waste":[75],"power":[77],"consumption.":[78],"This":[79],"article":[80,110],"presents":[81,111],"parallel":[83,151],"implementation":[84,135],"Bellman-Ford":[87],"exploits":[90],"architectural":[92],"characteristics":[93],"recent":[95],"GPU":[96],"architectures":[97],"(i.e.,":[98],"NVIDIA":[99],"Kepler,":[100],"Maxwell)":[101],"improve":[103],"both":[104,120],"performance":[105],"efficiency.":[108],"different":[112],"optimizations":[113],"implementation,":[116],"which":[117],"are":[118,166],"oriented":[119],"architecture.":[127],"experimental":[129],"results":[130],"show":[131],"proposed":[134],"provides":[136],"an":[137],"average":[138],"speedup":[139],"<inline-formula><tex-math":[141],"notation=\"LaTeX\">$5":[142],"\\times$":[143],"</tex-math></inline-formula>":[144],"higher":[145],"than":[146],"existing":[148],"most":[149],"efficient":[150],"implementations":[152,162],"SSSP,":[154],"it":[156,178],"works":[157],"on":[158],"graphs":[159,169],"where":[160],"those":[161],"cannot":[163],"or":[165],"inefficient":[167],"with":[170],"negative":[171],"weight":[172],"edges,":[173],"sparse":[174],"graphs),":[175],"sensibly":[179],"reduces":[180],"caused":[184],"by":[185],"parallelization":[187],"process.":[188]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}