{"id":"https://openalex.org/W2792745633","doi":"https://doi.org/10.1145/3174243.3174246","title":"ParaDRo","display_name":"ParaDRo","publication_year":2018,"publication_date":"2018-02-15","ids":{"openalex":"https://openalex.org/W2792745633","doi":"https://doi.org/10.1145/3174243.3174246","mag":"2792745633"},"language":"en","primary_location":{"id":"doi:10.1145/3174243.3174246","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3174243.3174246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","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/A5034193518","display_name":"Chin Hau Hoo","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Chin Hau Hoo","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100755285","display_name":"Akash Kumar","orcid":"https://orcid.org/0000-0001-7125-1737"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Akash Kumar","raw_affiliation_strings":["Technische Universit\u00e4t Dresden, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034193518"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":1.8025,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.85651035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"67","last_page":"76"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"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":1.0,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8864004611968994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8361543416976929},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7820590734481812},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.5811566114425659},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5324400663375854},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5141777992248535},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.46747303009033203},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.41152238845825195},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33790773153305054},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10339128971099854}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8864004611968994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8361543416976929},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7820590734481812},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.5811566114425659},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5324400663375854},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5141777992248535},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.46747303009033203},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.41152238845825195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33790773153305054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10339128971099854},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3174243.3174246","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3174243.3174246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","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":11,"referenced_works":["https://openalex.org/W1520093263","https://openalex.org/W1983241261","https://openalex.org/W2005602803","https://openalex.org/W2023428606","https://openalex.org/W2037455559","https://openalex.org/W2038935766","https://openalex.org/W2098903349","https://openalex.org/W2114820519","https://openalex.org/W2164340799","https://openalex.org/W2275304190","https://openalex.org/W2583892184"],"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/W2040141307"],"abstract_inverted_index":{"Routing":[0],"of":[1,5,20,29,41,77,89,143,151,168,179],"nets":[2,78,96,110,135,138,152],"is":[3,35,130],"one":[4],"the":[6,11,22,39,75,87,141,149,177],"most":[7],"time-consuming":[8],"steps":[9],"in":[10,118,157],"FPGA":[12,51],"design":[13],"flow.":[14],"Existing":[15,65],"works":[16],"have":[17,124],"described":[18],"ways":[19],"accelerating":[21],"process":[23],"through":[24],"parallelization.":[25],"However,":[26],"only":[27],"some":[28],"them":[30],"are":[31,98],"deterministic,":[32],"and":[33,147],"determinism":[34],"often":[36],"achieved":[37],"at":[38],"cost":[40],"speedup.":[42,64],"In":[43,92],"this":[44,106],"paper,":[45],"we":[46],"propose":[47],"ParaDRo,":[48],"a":[49,100,112],"parallel":[50,119],"router":[52],"based":[53,68],"on":[54,176],"spatial":[55,66,101,113],"partitioning":[56,67],"that":[57,79,97,153],"achieves":[58],"deterministic":[59],"results":[60],"while":[61],"maintaining":[62],"reasonable":[63],"routers":[69],"do":[70,122],"not":[71,123],"scale":[72],"well":[73],"because":[74],"number":[76,88,150],"can":[80,154],"fully":[81],"utilize":[82],"all":[83],"processors":[84,90],"reduces":[85],"as":[86],"increases.":[91],"addition,":[93],"they":[94,121],"route":[95],"within":[99,111],"partition":[102,114],"sequentially.":[103],"ParaDRo":[104,162],"mitigates":[105],"problem":[107],"by":[108,132],"scheduling":[109],"to":[115,139,163],"be":[116,155],"routed":[117,156],"if":[120],"overlapping":[125],"bounding":[126,144],"boxes.":[127],"Further":[128],"parallelism":[129],"extracted":[131],"decomposing":[133],"multi-sink":[134],"into":[136],"single-sink":[137],"minimize":[140],"amount":[142],"box":[145],"overlaps":[146],"increase":[148],"parallel.":[158],"These":[159],"improvements":[160],"enable":[161],"achieve":[164],"an":[165],"average":[166],"speedup":[167],"5.4X":[169],"with":[170,173],"8":[171],"threads":[172],"minimal":[174],"impact":[175],"quality":[178],"results.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2018-03-29T00:00:00"}