{"id":"https://openalex.org/W2166264746","doi":"https://doi.org/10.1145/1837274.1837323","title":"A parallel integer programming approach to global routing","display_name":"A parallel integer programming approach to global routing","publication_year":2010,"publication_date":"2010-06-13","ids":{"openalex":"https://openalex.org/W2166264746","doi":"https://doi.org/10.1145/1837274.1837323","mag":"2166264746"},"language":"en","primary_location":{"id":"doi:10.1145/1837274.1837323","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1837274.1837323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 47th Design Automation Conference","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/A5090688519","display_name":"Tai-Hsuan Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tai-Hsuan Wu","raw_affiliation_strings":["University of Wisconsin - Madison WI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin - Madison WI","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072204999","display_name":"Azadeh Davoodi","orcid":"https://orcid.org/0000-0001-5213-2556"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Azadeh Davoodi","raw_affiliation_strings":["University of Wisconsin - Madison WI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin - Madison WI","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046029284","display_name":"Jeff Linderoth","orcid":"https://orcid.org/0000-0003-4442-3059"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey T. Linderoth","raw_affiliation_strings":["University of Wisconsin - Madison WI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin - Madison WI","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"194","last_page":"199"},"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.9998000264167786,"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.9998000264167786,"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.9980999827384949,"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/T10142","display_name":"Formal Methods in Verification","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.7797094583511353},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6511133313179016},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5838108062744141},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5798256397247314},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5618520379066467},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5192594528198242},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.46889370679855347},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4585745930671692},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4524941146373749},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.40780869126319885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2691856026649475},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24052298069000244},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.17600494623184204}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7797094583511353},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6511133313179016},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5838108062744141},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5798256397247314},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5618520379066467},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5192594528198242},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.46889370679855347},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4585745930671692},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4524941146373749},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.40780869126319885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2691856026649475},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24052298069000244},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.17600494623184204},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1837274.1837323","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1837274.1837323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 47th Design Automation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.410.7070","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.410.7070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.cae.wisc.edu/~linderot/papers/Wu-Davoodi-Linderoth-10-2-PP.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.631.9119","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.631.9119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.cae.wisc.edu/~adavoodi/download/P-GRIP.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4548444100","display_name":null,"funder_award_id":"CCF-0914981","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W4694820","https://openalex.org/W92976189","https://openalex.org/W1578824783","https://openalex.org/W1967800299","https://openalex.org/W1969483458","https://openalex.org/W1975577567","https://openalex.org/W1977024562","https://openalex.org/W1978125595","https://openalex.org/W1979569488","https://openalex.org/W1998908216","https://openalex.org/W2006385089","https://openalex.org/W2011912079","https://openalex.org/W2020112047","https://openalex.org/W2022980325","https://openalex.org/W2041176678","https://openalex.org/W2046079692","https://openalex.org/W2051611158","https://openalex.org/W2056884147","https://openalex.org/W2067228890","https://openalex.org/W2071575532","https://openalex.org/W2071682149","https://openalex.org/W2078144752","https://openalex.org/W2084500359","https://openalex.org/W2085073472","https://openalex.org/W2095251710","https://openalex.org/W2097057459","https://openalex.org/W2097452558","https://openalex.org/W2098765048","https://openalex.org/W2105560970","https://openalex.org/W2111106757","https://openalex.org/W2113227516","https://openalex.org/W2122851474","https://openalex.org/W2124923188","https://openalex.org/W2125831674","https://openalex.org/W2128161498","https://openalex.org/W2130355852","https://openalex.org/W2131095522","https://openalex.org/W2133435384","https://openalex.org/W2135477945","https://openalex.org/W2136529615","https://openalex.org/W2137890965","https://openalex.org/W2140332639","https://openalex.org/W2143730739","https://openalex.org/W2149335048","https://openalex.org/W2149400771","https://openalex.org/W2149603028","https://openalex.org/W2153580689","https://openalex.org/W2154013992","https://openalex.org/W2155957882","https://openalex.org/W2158523263","https://openalex.org/W2159746935","https://openalex.org/W2159988760","https://openalex.org/W2160230920","https://openalex.org/W2162180547","https://openalex.org/W2164812572","https://openalex.org/W2165545669","https://openalex.org/W2167580124","https://openalex.org/W2167730834","https://openalex.org/W2167848093","https://openalex.org/W2168380797","https://openalex.org/W2168611993","https://openalex.org/W2168908650","https://openalex.org/W2171122650","https://openalex.org/W2201681339","https://openalex.org/W2275304190","https://openalex.org/W3004540582"],"related_works":["https://openalex.org/W2108305519","https://openalex.org/W1971663816","https://openalex.org/W1997091564","https://openalex.org/W2138640781","https://openalex.org/W3035942111","https://openalex.org/W2351097701","https://openalex.org/W2555559350","https://openalex.org/W2081964190","https://openalex.org/W2607223747","https://openalex.org/W2361465121"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,73,106,142,150],"parallel":[3],"global":[4,57,114],"routing":[5,10,33,44,58,82,89],"algorithm":[6,21,68,112,161],"that":[7,76,140],"concurrently":[8],"processes":[9],"subproblems":[11,45],"corresponding":[12],"to":[13,79,87,93,99,120],"rectangular":[14],"subregions":[15],"covering":[16],"the":[17,43,160,170],"chip":[18],"area.":[19],"The":[20,102,116],"uses":[22,77],"at":[23],"it":[24],"core":[25],"an":[26],"existing":[27],"integer":[28],"programming":[29],"(IP)":[30],"formulation---both":[31],"for":[32,37,48,113,126,141],"each":[34,88],"subproblem":[35,90],"and":[36,108,130],"connecting":[38],"them.":[39,101],"Concurrent":[40],"processing":[41],"of":[42,145,153],"is":[46,65,105,118],"desirable":[47],"effective":[49],"parallelization.":[50],"However,":[51],"achieving":[52],"no":[53],"(or":[54],"low)":[55],"overflow":[56],"solutions":[59,165],"without":[60],"strong,":[61],"coordinated":[62],"algorithmic":[63],"control":[64],"difficult.":[66],"Our":[67],"addresses":[69],"this":[70],"challenge":[71],"via":[72],"patching":[74],"phase":[75],"IP":[78],"connect":[80,100],"partial":[81],"solutions.":[83],"Patching":[84],"provides":[85],"feedback":[86],"in":[91,169],"order":[92],"avoid":[94],"overflow,":[95],"later":[96],"when":[97],"attempting":[98],"end":[103],"result":[104],"flexible":[107],"highly":[109],"scalable":[110],"distributed":[111],"routing.":[115],"method":[117],"able":[119],"accept":[121],"as":[122],"input":[123],"target":[124,143],"runtimes":[125],"its":[127],"various":[128],"phases":[129],"produce":[131],"high-quality":[132],"solution":[133],"within":[134],"these":[135],"limits.":[136],"Computational":[137],"results":[138],"show":[139],"runtime":[144],"75":[146],"minutes,":[147],"running":[148],"on":[149],"computational":[151],"grid":[152],"few":[154],"hundred":[155],"CPUs":[156],"with":[157],"2GB":[158],"memory,":[159],"generates":[162],"higher":[163],"quality":[164],"than":[166],"competing":[167],"methods":[168],"open":[171],"literature.":[172]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":13}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}