{"id":"https://openalex.org/W2116159333","doi":"https://doi.org/10.1145/1278480.1278494","title":"Escape routing for dense pin clusters in integrated circuits","display_name":"Escape routing for dense pin clusters in integrated circuits","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2116159333","doi":"https://doi.org/10.1145/1278480.1278494","mag":"2116159333"},"language":"en","primary_location":{"id":"doi:10.1145/1278480.1278494","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1278480.1278494","pdf_url":null,"source":{"id":"https://openalex.org/S4210231368","display_name":"Proceedings - ACM IEEE Design Automation Conference","issn_l":"0738-100X","issn":["0738-100X"],"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":"Proceedings of the 44th annual conference on Design automation - DAC '07","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","Intel Corporation, Hillsboro, OR#TAB#"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, Hillsboro, OR","institution_ids":["https://openalex.org/I1343180700"]},{"raw_affiliation_string":"Intel Corporation, Hillsboro, OR#TAB#","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103071783"],"corresponding_institution_ids":["https://openalex.org/I1343180700"],"apc_list":null,"apc_paid":null,"fwci":0.3512,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66359714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"49","last_page":"49"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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.9954000115394592,"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/routing","display_name":"Routing (electronic design automation)","score":0.8015444278717041},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7129737734794617},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5913912057876587},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5635700821876526},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.47034481167793274},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4676280617713928},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.46235308051109314},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4589444696903229},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.447243869304657},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4383496046066284},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.4342532157897949},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4233627915382385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4218025207519531},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4147742986679077},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34439051151275635},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.23918116092681885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18744072318077087},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14097875356674194},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08917626738548279}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.8015444278717041},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7129737734794617},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5913912057876587},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5635700821876526},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.47034481167793274},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4676280617713928},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.46235308051109314},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4589444696903229},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.447243869304657},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4383496046066284},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4342532157897949},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4233627915382385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4218025207519531},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4147742986679077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34439051151275635},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.23918116092681885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18744072318077087},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14097875356674194},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08917626738548279},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1278480.1278494","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1278480.1278494","pdf_url":null,"source":{"id":"https://openalex.org/S4210231368","display_name":"Proceedings - ACM IEEE Design Automation Conference","issn_l":"0738-100X","issn":["0738-100X"],"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":"Proceedings of the 44th annual conference on Design automation - DAC '07","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W2001912652","https://openalex.org/W2017697298","https://openalex.org/W2054938277","https://openalex.org/W2090220859","https://openalex.org/W2097774291","https://openalex.org/W2114532661","https://openalex.org/W2129736362","https://openalex.org/W2135477945","https://openalex.org/W2148774992","https://openalex.org/W2160474882","https://openalex.org/W2161474076","https://openalex.org/W2164262479","https://openalex.org/W2165465743","https://openalex.org/W2295318563","https://openalex.org/W2752885492","https://openalex.org/W3123221209","https://openalex.org/W3145128584","https://openalex.org/W3145853217","https://openalex.org/W4236384091"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2136173851","https://openalex.org/W2555559350","https://openalex.org/W2607223747","https://openalex.org/W2361465121"],"abstract_inverted_index":{"As":[0],"the":[1,9,24,36,89,100,115,138,148,151,173,183,189],"design":[2],"complexities":[3],"and":[4,18,48,113,153,196],"circuit":[5],"densities":[6],"are":[7,103],"increasing,":[8],"detailed":[10],"routing":[11,37,63,68,92,140],"(DR)":[12],"problem":[13,117],"is":[14,31,145,159],"becoming":[15],"a":[16,70,82,95,111,126,134,166],"more":[17,19],"challenging":[20],"problem.":[21,141,175],"Due":[22],"to":[23,34,50,87,171],"high":[25],"complexity":[26],"of":[27,69,72,97,191],"DR":[28],"algorithms,":[29],"it":[30],"very":[32],"important":[33],"start":[35],"process":[38],"with":[39,45,118,137],"clean":[40],"solutions,":[41],"rather":[42],"than":[43],"starting":[44],"suboptimal":[46],"routes":[47],"trying":[49],"fix":[51],"them":[52],"in":[53,147],"iterative":[54],"process.":[55],"In":[56],"this":[57,108,162,180],"paper,":[58],"we":[59,79,106,124,164],"propose":[60,81,125,165],"an":[61],"escape":[62,91,139,174],"algorithm":[64,84,109,170,181],"that":[65,85,132,150,179,193],"can":[66],"optimize":[67],"set":[71,96],"nets":[73,98,192],"around":[74],"their":[75],"terminals.":[76],"For":[77,122],"this,":[78,123],"first":[80],"polynomial-time":[83],"guarantees":[86],"find":[88],"optimal":[90],"solution":[93],"for":[94],"when":[99],"track":[101,120],"structures":[102],"uniform.":[104],"Then,":[105],"use":[107],"as":[110],"baseline,":[112],"study":[114],"general":[116],"arbitrary":[119],"structures.":[121],"novel":[127,146],"multi-commodity":[128],"flow":[129,157],"(MCF)":[130],"model":[131,144],"has":[133],"one-to-one":[135],"correspondence":[136],"This":[142],"MCF":[143],"sense":[149],"inter-dependency":[152],"contention":[154],"between":[155],"different":[156],"commodities":[158],"minimal.":[160],"Using":[161],"model,":[163],"Lagrangian-relaxation":[167],"(LR)":[168],"based":[169],"solve":[172],"Our":[176],"experiments":[177],"demonstrate":[178],"improves":[182],"overall":[184],"routability":[185],"significantly":[186],"by":[187],"reducing":[188],"number":[190],"require":[194],"rip-up":[195],"reroute.":[197]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}