{"id":"https://openalex.org/W2276876697","doi":"https://doi.org/10.1109/reconfig.2015.7393284","title":"Accelerating all-pairs shortest path using a message-passing reconfigurable architecture","display_name":"Accelerating all-pairs shortest path using a message-passing reconfigurable architecture","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2276876697","doi":"https://doi.org/10.1109/reconfig.2015.7393284","mag":"2276876697"},"language":"en","primary_location":{"id":"doi:10.1109/reconfig.2015.7393284","is_oa":false,"landing_page_url":"https://doi.org/10.1109/reconfig.2015.7393284","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)","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/A5078669544","display_name":"Osama G. Attia","orcid":"https://orcid.org/0000-0002-7663-5534"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Osama G. Attia","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042393089","display_name":"Alex Grieve","orcid":"https://orcid.org/0000-0001-9439-8598"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Grieve","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032062942","display_name":"Kevin R. Townsend","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin R. Townsend","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026774201","display_name":"Phillip H. Jones","orcid":"https://orcid.org/0000-0002-8220-7552"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Phillip Jones","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081541206","display_name":"Joseph Zambreno","orcid":"https://orcid.org/0000-0002-0566-5744"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Zambreno","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3744,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7045022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8465267419815063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8334392309188843},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6923521757125854},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6308757066726685},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.5934606194496155},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5593069791793823},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.5536957383155823},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.49425649642944336},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4428033232688904},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4367187023162842},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.4227983355522156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24132347106933594},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.21648383140563965},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.15272164344787598},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09969833493232727}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8465267419815063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8334392309188843},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6923521757125854},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6308757066726685},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.5934606194496155},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5593069791793823},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.5536957383155823},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.49425649642944336},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4428033232688904},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4367187023162842},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4227983355522156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24132347106933594},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.21648383140563965},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.15272164344787598},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09969833493232727},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/reconfig.2015.7393284","is_oa":false,"landing_page_url":"https://doi.org/10.1109/reconfig.2015.7393284","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1482680420","https://openalex.org/W1506342804","https://openalex.org/W1507039213","https://openalex.org/W1519532587","https://openalex.org/W1572663059","https://openalex.org/W1969970763","https://openalex.org/W1972032402","https://openalex.org/W2028645759","https://openalex.org/W2030201370","https://openalex.org/W2038509324","https://openalex.org/W2045271686","https://openalex.org/W2046526098","https://openalex.org/W2054882590","https://openalex.org/W2055497547","https://openalex.org/W2057084070","https://openalex.org/W2059858776","https://openalex.org/W2087520172","https://openalex.org/W2088241931","https://openalex.org/W2096544401","https://openalex.org/W2103624880","https://openalex.org/W2113921339","https://openalex.org/W2123846711","https://openalex.org/W2149899545","https://openalex.org/W2157534438","https://openalex.org/W2170616854","https://openalex.org/W2317720307","https://openalex.org/W4235101327","https://openalex.org/W4254861230"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W2157978810","https://openalex.org/W2597809628","https://openalex.org/W1966837078"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,39,101],"design":[6,66],"and":[7,62,105],"implementation":[8,37,51],"of":[9,30,38,78,98,109],"a":[10,20,35,53,76,82,112],"reconfigurable":[11],"architecture":[12,18,32],"for":[13,45,71],"graph":[14],"processing":[15,55],"algorithms.":[16],"The":[17],"uses":[19],"message-passing":[21],"model":[22],"targeting":[23],"shared-memory":[24],"multi-FPGA":[25],"platforms.":[26],"We":[27,74],"take":[28],"advantage":[29],"our":[31,79,91],"to":[33,59],"showcase":[34],"parallel":[36,69],"all-pairs":[40],"shortest":[41],"path":[42],"algorithm":[43,104],"(APSP)":[44],"unweighted":[46],"directed":[47],"graphs.":[48],"Our":[49,65],"APSP":[50,103],"adopts":[52],"fine-grain":[54],"methodology":[56],"while":[57],"attempting":[58],"minimize":[60],"communication":[61],"synchronization":[63],"overhead.":[64],"utilizes":[67],"64":[68],"kernels":[70],"vertex-centric":[72],"processing.":[73],"evaluate":[75],"prototype":[77],"system":[80],"on":[81],"Convey":[83],"HC-2":[84],"high":[85],"performance":[86,92],"computing":[87],"platform,":[88],"in":[89],"which":[90],"results":[93],"demonstrates":[94],"an":[95,106],"average":[96,107],"speedup":[97,108],"7:9\u00d7":[99],"over":[100,111],"sequential":[102],"2:38\u00d7":[110],"multi-core":[113],"implementation.":[114]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}