Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. Path-constrained and incremental floorplanning using sequence pairs
Details

Path-constrained and incremental floorplanning using sequence pairs

Date Issued
May 1, 2000
Author(s)
Yu, Cheng Chang
Advisor(s)
Dinesh Mehta
Additional Advisor(s)
Bruce Bomar
Permanent URI
https://trace.tennessee.edu/handle/20.500.14382/46174
Abstract

This research focuses on the floorplanning stage of the VLSI physical design cycle. The first part of this research is on path-constrained floorplan. In order to maximize CPU performance and improve clock cycle time, modules on critical paths must be placed in a straight line from an input pin to an output pin. This technique uses the sequence-pairs method. The second part of this research is on incremental floorplan. Given a floorplan, we want to generate a different floorplan that is very similar to the original floorplan after incremented changes in module sizes have been made. Once again, we use sequence-pairs with various cost functions to solve the problem. We have been successful in obtaining a provably correct solution for a limited version of the path-constrained problem. Experimental results demonstrating the efficiency of our methods are also presented.

Degree
Master of Science
Major
Computer Science
File(s)
Thumbnail Image
Name

Thesis2000Y83.pdf

Size

1.68 MB

Format

Unknown

Checksum (MD5)

56b78b790f0699cd7b7c35b6fca85edc

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
  • Contact
  • Libraries at University of Tennessee, Knoxville
Repository logo COAR Notify