{"id":"https://openalex.org/W2149899545","doi":null,"title":"Parallel FPGA-based All-Pairs Shortest-Paths in a Directed Graph","display_name":"Parallel FPGA-based All-Pairs Shortest-Paths in a Directed Graph","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2149899545","mag":"2149899545"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.5032","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.5032","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ohio-state.edu/~bondhugu/publications/uday-parallel-fw.ps","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5025342111","display_name":"Uday Kumar Reddy Bondhugula","orcid":"https://orcid.org/0000-0002-8297-6159","observed_orcids":["https://orcid.org/0000-0002-8297-6159"]},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Uday Bondhugula","raw_affiliation_strings":["Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA,","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038783523","display_name":"Ananth Devulapalli","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I34077533","display_name":"Ohio Supercomputer Center","ror":"https://ror.org/01apna436","country_code":"US","type":"facility","lineage":["https://openalex.org/I34077533"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ananth Devulapalli","raw_affiliation_strings":["Ohio Supercomputer Center Springfield, Springfield, OH#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ohio Supercomputer Center Springfield, Springfield, OH#TAB#","institution_ids":["https://openalex.org/I34077533"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Joseph Fernando","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I34077533","display_name":"Ohio Supercomputer Center","ror":"https://ror.org/01apna436","country_code":"US","type":"facility","lineage":["https://openalex.org/I34077533"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Fernando","raw_affiliation_strings":["Ohio Supercomputer Center Springfield, Springfield, OH#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ohio Supercomputer Center Springfield, Springfield, OH#TAB#","institution_ids":["https://openalex.org/I34077533"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109902684","display_name":"Pete Wyckoff","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I34077533","display_name":"Ohio Supercomputer Center","ror":"https://ror.org/01apna436","country_code":"US","type":"facility","lineage":["https://openalex.org/I34077533"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pete Wyckoff","raw_affiliation_strings":["Ohio Supercomputer Center Columbus, OH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ohio Supercomputer Center Columbus, OH","institution_ids":["https://openalex.org/I34077533"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027517817","display_name":"Ponnuswamy Sadayappan","orcid":"https://orcid.org/0000-0002-4737-2034","observed_orcids":["https://orcid.org/0000-0002-4737-2034"]},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Sadayappan","raw_affiliation_strings":["Dept. of Computer Science and Engineering, The Ohio State University, Columbus, OH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, The Ohio State University, Columbus, OH","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.8562,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.97899577,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.6679999828338623,"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"}},"topics":[{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.6679999828338623,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.28760001063346863,"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/T13292","display_name":"Embedded Systems and FPGA Applications","score":0.00839999970048666,"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/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.8690000176429749},{"id":"https://openalex.org/keywords/floyd-warshall-algorithm","display_name":"Floyd-Warshall algorithm","score":0.9610000252723694},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.8640000224113464},{"id":"https://openalex.org/keywords/fpga-implementation","display_name":"FPGA implementation","score":0.6919999718666077},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.7080000042915344},{"id":"https://openalex.org/keywords/bioinformatics-applications","display_name":"bioinformatics applications","score":0.8080000281333923},{"id":"https://openalex.org/keywords/data-dependencies","display_name":"data dependencies","score":0.6579999923706055},{"id":"https://openalex.org/keywords/cray-xd1","display_name":"Cray XD1","score":0.7310000061988831},{"id":"https://openalex.org/keywords/hardware-acceleration","display_name":"hardware acceleration","score":0.6380000114440918}],"concepts":[{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.8470133543014526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8373851776123047},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7518780827522278},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7296497821807861},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4949166178703308},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.484939843416214},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42580294609069824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2636290192604065},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.21616998314857483}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.5032","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.5032","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ohio-state.edu/~bondhugu/publications/uday-parallel-fw.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.63.5495","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.5495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ohio-state.edu/~bondhugu/publications/uday-parallel-fw.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.4852","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.4852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.osc.edu/~pw/papers/bondhugula-fpga-ipdps06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W301824129","https://openalex.org/W1553214226","https://openalex.org/W1975558464","https://openalex.org/W1976515269","https://openalex.org/W1984087192","https://openalex.org/W2007572995","https://openalex.org/W2035449679","https://openalex.org/W2104734478","https://openalex.org/W2121810137","https://openalex.org/W2130265542","https://openalex.org/W2160875291","https://openalex.org/W2752885492","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W7099509716","https://openalex.org/W2110963641","https://openalex.org/W2184939461","https://openalex.org/W7097547902","https://openalex.org/W7098543878","https://openalex.org/W7099962851","https://openalex.org/W2059858776","https://openalex.org/W4283690812","https://openalex.org/W1504830722","https://openalex.org/W4393300429"],"abstract_inverted_index":{"With":[0],"rapid":[1],"advances":[2],"in":[3,43,83],"VLSI":[4],"technology,":[5],"Field":[6],"Programmable":[7],"Gate":[8],"Arrays":[9],"(FPGAs)":[10],"are":[11],"receiving":[12],"the":[13,16,34,39,71,84,98,109],"attention":[14],"of":[15,70,74,86,104],"Parallel":[17],"and":[18,67],"High":[19],"Performance":[20],"Computing":[21],"community.":[22],"In":[23],"this":[24,59],"paper,":[25],"we":[26,63],"propose":[27,64],"a":[28,44,52,93,102],"highly":[29],"parallel":[30],"FPGA":[31,79,95],"design":[32,62],"for":[33],"Floyd-Warshall":[35],"algorithm":[36],"to":[37,80],"solve":[38],"allpairs":[40],"shortest-paths":[41],"problem":[42],"directed":[45],"graph.":[46],"Our":[47],"work":[48],"is":[49],"motivated":[50],"by":[51],"computationally":[53],"intensive":[54],"bio-informatics":[55],"application":[56],"that":[57],"employs":[58],"algorithm.":[60],"The":[61],"makes":[65],"efficient":[66],"maximal":[68],"utilization":[69],"large":[72],"amount":[73],"resources":[75],"available":[76],"on":[77,97,108],"an":[78],"maximize":[81],"parallelism":[82],"presence":[85],"significant":[87],"data":[88],"dependences.":[89],"Experimental":[90],"results":[91],"from":[92],"working":[94],"implementation":[96],"Cray":[99],"XD1":[100],"show":[101],"speedup":[103],"22":[105],"over":[106],"execution":[107],"XD1's":[110],"processor.":[111]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}