{"id":"https://openalex.org/W1504830722","doi":"https://doi.org/10.1109/fpt.2002.1188697","title":"Serial-parallel tradeoff analysis of all-pairs shortest path algorithms in reconfigurable computing","display_name":"Serial-parallel tradeoff analysis of all-pairs shortest path algorithms in reconfigurable computing","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W1504830722","doi":"https://doi.org/10.1109/fpt.2002.1188697","mag":"1504830722"},"language":"en","primary_location":{"id":"doi:10.1109/fpt.2002.1188697","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2002.1188697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings.","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/A5057783462","display_name":"Sui-Tung Mak","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Sui-Tung Mak","raw_affiliation_strings":["Department of System Engineering and Engineering Management, Chinese University of Hong Kong, New Territories, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of System Engineering and Engineering Management, Chinese University of Hong Kong, New Territories, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111889021","display_name":"Kai-Pui Lam","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Kai-Pui Lam","raw_affiliation_strings":["Department of System Engineering and Engineering Management, Chinese University of Hong Kong, New Territories, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of System Engineering and Engineering Management, Chinese University of Hong Kong, New Territories, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":0.3543,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.59025835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"302","last_page":"305"},"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.9994999766349792,"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.9994999766349792,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9990000128746033,"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.9988999962806702,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8377487659454346},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8034282922744751},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7025318145751953},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5752193927764893},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.4963887333869934},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4794113337993622},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47603514790534973},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4503900706768036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4485154449939728},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.4478135406970978},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4268359839916229},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4173544943332672},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35625943541526794},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14336690306663513},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12561967968940735}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8377487659454346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8034282922744751},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7025318145751953},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5752193927764893},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.4963887333869934},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4794113337993622},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47603514790534973},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4503900706768036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4485154449939728},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.4478135406970978},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4268359839916229},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4173544943332672},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35625943541526794},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14336690306663513},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12561967968940735},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fpt.2002.1188697","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2002.1188697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1490507553","https://openalex.org/W2091826883","https://openalex.org/W6629404908"],"related_works":["https://openalex.org/W2388051136","https://openalex.org/W2357391150","https://openalex.org/W2156431668","https://openalex.org/W2144050074","https://openalex.org/W2370345607","https://openalex.org/W2161960576","https://openalex.org/W2996337372","https://openalex.org/W2300956438","https://openalex.org/W1992129517","https://openalex.org/W2134900907"],"abstract_inverted_index":{"Implementation":[0],"of":[1,24,35,52,74],"shortest":[2,25,54],"path":[3,26],"algorithm":[4,30,37],"in":[5,38,49],"FPGA":[6],"has":[7],"been":[8],"recently":[9],"proposed":[10],"for":[11,28,56,79],"solving":[12],"the":[13,20,32,39,50,75],"network":[14,78],"routing":[15],"problem.":[16],"This":[17],"paper":[18],"discusses":[19],"architecture":[21],"and":[22,31,64,92],"implementation":[23,34,73],"algorithms":[27],"Floyd-Warshall":[29],"parallel":[33],"Bellman-Ford":[36],"Binary":[40],"Relation":[41],"Inference":[42],"Network":[43],"architecture.":[44],"There":[45],"are":[46,68],"significant":[47],"differences":[48],"performance":[51],"computing":[53],"paths":[55],"these":[57],"two":[58],"different":[59],"approaches.":[60],"The":[61],"computation":[62,88],"speed":[63],"resource":[65,90],"consumption":[66],"issues":[67],"discussed.":[69],"An":[70],"alternative,":[71],"serial":[72],"synchronized":[76],"inference":[77],"single-destination":[80],"problem":[81,94],"is":[82],"also":[83],"explored,":[84],"with":[85],"emphasis":[86],"on":[87],"time,":[89],"consumption,":[91],"scaling":[93],"size.":[95]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}