{"id":"https://openalex.org/W1598536440","doi":"https://doi.org/10.1109/iccad.2004.1382690","title":"A provably good algorithm for high performance bus routing","display_name":"A provably good algorithm for high performance bus routing","publication_year":2005,"publication_date":"2005-02-22","ids":{"openalex":"https://openalex.org/W1598536440","doi":"https://doi.org/10.1109/iccad.2004.1382690","mag":"1598536440"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2004.1382690","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5103071783","display_name":"Muhammet Mustafa \u00d6zdal","orcid":"https://orcid.org/0000-0002-6239-9622"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.M. Ozdal","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053378706","display_name":"Martin D. F. Wong","orcid":"https://orcid.org/0000-0001-8274-9688"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP","US"],"is_corresponding":false,"raw_author_name":"M.D.F. Wong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Dept. Commun. & Comput. Eng, Kyoto Univ., Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. Commun. & Comput. Eng, Kyoto Univ., Japan","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3213,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.9435909,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"830","last_page":"837"},"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.9997000098228455,"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/T10363","display_name":"Low-power high-performance VLSI design","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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6995866298675537},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6853594779968262},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6064119338989258},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6038902997970581},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5423151254653931},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5391902923583984},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5377078056335449},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.43148383498191833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.416983962059021},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37971818447113037},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3392959535121918},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2149975597858429},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1929309070110321}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6995866298675537},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6853594779968262},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6064119338989258},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6038902997970581},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5423151254653931},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5391902923583984},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5377078056335449},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.43148383498191833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.416983962059021},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37971818447113037},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3392959535121918},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2149975597858429},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1929309070110321},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iccad.2004.1382690","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.7423","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.7423","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iccad.com/data2/iccad/iccad_04acceptedpapers.nsf/9cfb1ebaaf59043587256a6a00031f78/05b356a07f29751d87256ebb00620d5f/$FILE/10C02.PDF","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1591103387","https://openalex.org/W2012741606","https://openalex.org/W2075693636","https://openalex.org/W2103741020","https://openalex.org/W2123094965","https://openalex.org/W2139637699","https://openalex.org/W2143827795","https://openalex.org/W2144677702","https://openalex.org/W2147555712","https://openalex.org/W2150688419","https://openalex.org/W2151807819","https://openalex.org/W2158598102","https://openalex.org/W2160474882","https://openalex.org/W2170828467","https://openalex.org/W4206112811","https://openalex.org/W4235383258","https://openalex.org/W4237638069","https://openalex.org/W4243122809","https://openalex.org/W6653552820"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2108305519","https://openalex.org/W3127002380","https://openalex.org/W2555559350","https://openalex.org/W2369989480","https://openalex.org/W2081964190","https://openalex.org/W2124642421","https://openalex.org/W2607223747","https://openalex.org/W2361465121","https://openalex.org/W2030786877"],"abstract_inverted_index":{"As":[0],"the":[1,9,32,39,44,99,135,148,151],"clock":[2],"frequencies":[3],"used":[4],"in":[5],"industrial":[6],"applications":[7],"increase,":[8],"timing":[10],"requirements":[11],"on":[12,31],"routing":[13,19,36,64,87],"problems":[14],"become":[15],"tighter,":[16],"and":[17,71,141],"current":[18],"tools":[20],"can":[21],"not":[22],"successfully":[23],"handle":[24],"these":[25],"constraints":[26,103],"any":[27],"more.":[28],"We":[29,79,110],"focus":[30],"high-performance":[33],"single-layer":[34],"bus":[35],"problem,":[37],"where":[38,101,145],"objective":[40],"is":[41,60,116,147],"to":[42,50,56,61,98,128],"match":[43],"lengths":[45],"of":[46,150],"all":[47],"nets":[48,68,88],"belonging":[49],"each":[51],"bus.":[52],"An":[53],"effective":[54],"approach":[55],"solve":[57],"this":[58,96,114],"problem":[59],"allocate":[62],"extra":[63],"resources":[65,74],"around":[66],"short":[67],"during":[69],"routing;":[70],"use":[72],"those":[73],"for":[75,86,131],"length":[76,108],"extension":[77],"afterwards.":[78],"first":[80],"propose":[81],"a":[82,119],"provably":[83],"optimal":[84,117],"algorithm":[85,97,115],"with":[89],"min-area":[90],"max-length":[91],"constraints.":[92],"Then,":[93],"we":[94],"extend":[95],"case":[100],"minimum":[102],"are":[104,125,139],"given":[105],"as":[106],"exact":[107],"bounds.":[109],"also":[111,126],"prove":[112],"that":[113],"within":[118],"constant":[120],"factor.":[121],"Both":[122],"algorithms":[123],"proposed":[124],"shown":[127],"be":[129],"scalable":[130],"large":[132],"circuits,":[133],"since":[134],"respective":[136],"time":[137],"complexities":[138],"O(A)":[140],"O(A":[142],"log":[143],"A),":[144],"A":[146],"area":[149],"intermediate":[152],"region":[153],"between":[154],"chips.":[155]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}