This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/23386
Description
Title
Timing-driven optimization problems in VLSI CAD
Author(s)
Mathur, Anmol
Issue Date
1995
Doctoral Committee Chair(s)
Liu, C.L.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Computer Science
Language
eng
Abstract
We study several optimization problems that arise in the design of VLSI circuits, with the satisfaction of timing constraints as the primary objective. We focus on problems where the underlying architecture is regular. Field Programmable Gate Arrays (FPGAs), identical standard cell based architectures and WSI arrays of blocks having a regular structure are the major architectures that are regular. The regularity of these architectures allows us to use powerful graph theoretic techniques that would not be possible otherwise.
In this thesis we study problems at several different steps in the FPGA design flow. We address the problems of timing driven technology mapping and placement. We also study the problem of reconfiguring the placement of a circuit on an FPGA in order to tolerate faults in the logic blocks of the FPGA without significant degradation in the circuit delay. This problem is referred to as the timing driven reconfiguration problem. Timing driven reconfiguration can be used for off-line reconfiguration for yield enhancement and for on-line reconfiguration for fault tolerance. In a typical design flow, the design may be altered several times after the initial design cycle according to minor changes in the design specification either as a result of design debugging or as a result of changes in engineering requirements. In order to speed up the entire design process it is important to efficiently handle these engineering changes. We study the problem of incorporating engineering changes into a design in the presence of timing constraints. We propose a unified approach to solving the timing driven placement, reconfiguration and re-engineering problems using the concept of slack neighborhood graph.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
