2026-09-19T19:00:11Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81689 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Wong, Martin D.F. Ozdal, Muhammet Mustafa 2015-09-25T20:20:01Z 2015-09-25T20:20:01Z 10000-01-01 2005 2005 As the package densities are increasing, escape routing is becoming the main bottleneck in terms of overall routability. For this, we propose novel models and algorithms to solve the escape routing problem in multiple components simultaneously, such that the number of crossings in the intermediate area (between components) is minimized. Finally, we focus on the problem of escape routing within dense pin clusters, which can have arbitrary convex boundaries. We propose a set of sufficient and necessary conditions that guarantee routability outside the escape boundaries. We also discuss how these conditions can be incorporated effectively into an escape routing algorithm. Made available in DSpace on 2015-09-25T20:20:01Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3199107.pdf: 4873055 bytes, checksum: 43c4599daf15f57b7a853e3f57e42a8c (MD5) Previous issue date: 2005 Embargo set by: Seth Robbins for item 82970 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 152 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005. http://hdl.handle.net/2142/81689 (MiAaPQ)AAI3199107 eng Computer Science Routing Algorithms for High-Performance VLSI Packaging text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.