{"id":"https://openalex.org/W3142387955","doi":"https://doi.org/10.1109/iccad.2007.4397312","title":"Archer: a history-driven global routing algorithm","display_name":"Archer: a history-driven global routing algorithm","publication_year":2007,"publication_date":"2007-11-01","ids":{"openalex":"https://openalex.org/W3142387955","doi":"https://doi.org/10.1109/iccad.2007.4397312","mag":"3142387955"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2007.4397312","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2007.4397312","pdf_url":null,"source":{"id":"https://openalex.org/S4210177401","display_name":"Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design","issn_l":"1092-3152","issn":["1092-3152","1558-2434"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE/ACM International Conference on Computer-Aided Design","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/A5103071783","display_name":"Muhammet Mustafa \u00d6zdal","orcid":"https://orcid.org/0000-0002-6239-9622"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Muhammet Mustafa Ozdal","raw_affiliation_strings":["Intel Corporation, Hillsboro, OR, USA"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, Hillsboro, OR, USA","institution_ids":["https://openalex.org/I1343180700"]}]},{"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin D. F. Wong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103071783"],"corresponding_institution_ids":["https://openalex.org/I1343180700"],"apc_list":null,"apc_paid":null,"fwci":5.6198,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.96126875,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"488","last_page":"495"},"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.9998999834060669,"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.9998999834060669,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9991000294685364,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9973000288009644,"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/routing","display_name":"Routing (electronic design automation)","score":0.6901209354400635},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.680976390838623},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.5046390295028687},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5019617080688477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4727666676044464},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4151044487953186},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.41454100608825684},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.32886213064193726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24718549847602844},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08122190833091736}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6901209354400635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.680976390838623},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.5046390295028687},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5019617080688477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4727666676044464},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4151044487953186},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.41454100608825684},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32886213064193726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24718549847602844},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08122190833091736}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2007.4397312","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2007.4397312","pdf_url":null,"source":{"id":"https://openalex.org/S4210177401","display_name":"Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design","issn_l":"1092-3152","issn":["1092-3152","1558-2434"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE/ACM International Conference on Computer-Aided Design","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1975577567","https://openalex.org/W2017697298","https://openalex.org/W2054938277","https://openalex.org/W2064086982","https://openalex.org/W2085073472","https://openalex.org/W2110827694","https://openalex.org/W2123796580","https://openalex.org/W2135477945","https://openalex.org/W2151807819","https://openalex.org/W2155462145","https://openalex.org/W2165465743","https://openalex.org/W2168690316","https://openalex.org/W2275304190","https://openalex.org/W4236384091","https://openalex.org/W4237638069","https://openalex.org/W4243621528","https://openalex.org/W4248699322","https://openalex.org/W6643977565","https://openalex.org/W6682277506","https://openalex.org/W6824866093"],"related_works":["https://openalex.org/W2021808862","https://openalex.org/W2105127960","https://openalex.org/W2075067217","https://openalex.org/W4254709952","https://openalex.org/W2026034687","https://openalex.org/W2362006006","https://openalex.org/W1687060458","https://openalex.org/W1976154696","https://openalex.org/W2353466952","https://openalex.org/W2609535666"],"abstract_inverted_index":{"Global":[0,196],"routing":[1,19,93,98,215],"is":[2,37,176,209],"an":[3,90],"important":[4],"step":[5],"in":[6,81,170,193,199],"the":[7,26,31,65,97,115,154,171,177,189,194,210,224,229],"physical":[8],"design":[9],"process.":[10],"In":[11,85],"this":[12,86],"paper,":[13,87],"we":[14,88,135],"propose":[15,89,136],"a":[16,61,121,137],"new":[17],"global":[18,34,41,92,214],"algorithm":[20,94,145],"Archer,":[21],"which":[22,56,175,208],"resolves":[23],"some":[24],"of":[25,101,107,117,128,156,201],"most":[27],"common":[28],"problems":[29],"with":[30],"state-of-":[32,211],"the-art":[33,212],"routers.":[35],"It":[36],"known":[38],"that":[39,95,146,162],"concurrent":[40],"rou-":[42],"ting":[43],"algorithms":[44,74],"are":[45,75],"typically":[46],"too":[47],"expensive":[48],"to":[49,60,78,119,150,204],"be":[50],"applied":[51],"on":[52,114,228,232],"today\u2019s":[53],"large":[54],"designs,":[55],"may":[57],"contain":[58],"up":[59],"million":[62],"nets.":[63],"On":[64],"other":[66],"hand,":[67],"iterative":[68],"rip-up":[69],"and":[70,131,222],"reroute":[71],"(RNR)":[72],"based":[73,140],"sus-":[76],"ceptible":[77],"getting":[79],"stuck":[80],"local":[82,102],"optimal":[83],"solutions.":[84],"RNR-based":[91,213],"guides":[96],"iterations":[99],"out":[100],"optima":[103],"through":[104],"effective":[105],"usage":[106],"con-":[108],"gestion":[109],"histories.":[110],"We":[111],"also":[112],"focus":[113],"problem":[116],"how":[118],"enable":[120],"smooth":[122],"trade-off":[123],"between":[124],"seemingly":[125],"conflicting":[126],"objectives":[127],"over-":[129],"flow":[130],"wirelength":[132],"minimization.":[133],"Furthermore,":[134,183],"Lagrangian":[138],"relaxation":[139],"bounded-length":[141],"min-cost":[142],"topology":[143],"improvement":[144],"enables":[147],"Steiner":[148],"trees":[149],"change":[151],"dynamically":[152],"for":[153,167],"purpose":[155],"congestion":[157],"optimization.":[158],"Our":[159],"experiments":[160],"show":[161],"Archer":[163,217],"obtains":[164],"congestion-free":[165],"solutions":[166],"all":[168],"circuits":[169],"standard":[172],"ISPD98":[173],"benchmarks,":[174],"best":[178,190],"result":[179],"published":[180],"so":[181],"far.":[182],"it":[184],"produces":[185],"better":[186],"results":[187,191],"than":[188],"reported":[192],"ISPD-07":[195],"Routing":[197],"Contest":[198],"terms":[200],"routability.":[202],"Compared":[203],"FastRoute":[205],"[18,":[206],"19],":[207],"algorithm,":[216],"improves":[218],"routability":[219],"by":[220,226],"30%,":[221],"reduces":[223],"wirelengths":[225],"32%":[227],"av-":[230],"erage":[231],"ISPD07":[233],"benchmarks.":[234]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}