Files in this item



application/pdf3199107.pdf (5MB)Restricted to U of Illinois
(no description provided)PDF


Title:Routing Algorithms for High-Performance VLSI Packaging
Author(s):Ozdal, Muhammet Mustafa
Doctoral Committee Chair(s):Wong, Martin D.F.
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Computer Science
Abstract: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.
Issue Date:2005
Description:152 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.
Other Identifier(s):(MiAaPQ)AAI3199107
Date Available in IDEALS:2015-09-25
Date Deposited:2005

This item appears in the following Collection(s)

Item Statistics