Item Details

Sharp-Looking Geometric Partitioning

Bapat, S; Cohoon, J
Format
Report
Author
Bapat, S
Cohoon, J
Abstract
A new technique, named SHARP, is presented for the partitioning of VLSI integrated circuits. SHARP is a hillclimbing heuristic that is designed to be incorporated into a partitioning-based placement algorithm. Its important features include a geometric decomposition of the layout surface into a ‘‘#''-shaped region; a multi-objective function that more accurately represents wire usage than the standard min-cut criterion, and extensive use of Steiner trees. A series of experiments demonstrates that the SHARP technique produce very high quality partitions. Note: Abstract extracted from PDF file via OCR
Language
English
Date Received
20121029
Published
University of Virginia, Department of Computer Science, 1990
Published Date
1990
Collection
Libra Open Repository
Logo for In CopyrightIn Copyright

Availability

Access Online