Delay bounded buffered tree construction for timing driven floorplanning

Authors:
Maggie Kang;Wayne W.-M. Dai;Tom Dillinger;David LaPotin
Affiliations:
Computer Engineering Department, University of California, Santa Cruz, CA;Computer Engineering Department, University of California, Santa Cruz, CA;Rockwell Semiconductor San Diego, CA 92121;IBM Austin Research Lab., Austin, Texas 78758
Venue:
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 16
Cited 14

Bounded diameter minimum spanning trees and related problems

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
The fanout problem: from theory to practice

Proceedings of the decennial Caltech conference on VLSI on Advanced research in VLSI
Performance-oriented technology mapping

AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
A heuristic algorithm for the fanout problem

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Performance oriented rectilinear Steiner trees

DAC '93 Proceedings of the 30th international Design Automation Conference
Performance-driven Steiner tree algorithm for global routing

DAC '93 Proceedings of the 30th international Design Automation Conference
High-performance routing trees with identified critical sinks

DAC '93 Proceedings of the 30th international Design Automation Conference
Routability-driven fanout optimization

DAC '93 Proceedings of the 30th international Design Automation Conference
Performance-driven interconnect design based on distributed RC delay model

DAC '93 Proceedings of the 30th international Design Automation Conference
A methodology and algorithms for post-placement delay optimization

DAC '94 Proceedings of the 31st annual Design Automation Conference
Rectilinear Steiner trees with minimum Elmore delay

DAC '94 Proceedings of the 31st annual Design Automation Conference
Buffered Steiner tree construction with wire sizing for interconnect layout optimization

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Wire segmenting for improved buffer insertion

DAC '97 Proceedings of the 34th annual Design Automation Conference
Performance-Driven Global Routing for Cell Based ICs

ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Critical Net Routing

ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Chip and package cosynthesis of clock networks

Chip and package cosynthesis of clock networks

Buffer insertion for noise and delay optimization

DAC '98 Proceedings of the 35th annual Design Automation Conference
Timing driven maze routing

ISPD '99 Proceedings of the 1999 international symposium on Physical design
Routability-driven repeater block planning for interconnect-centric floorplanning

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Buffer block planning for interconnect-driven floorplanning

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Meeting delay constraints in DSM by minimal repeater insertion

DATE '00 Proceedings of the conference on Design, automation and test in Europe
Buffer block planning for interconnect planning and prediction

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - System Level Design
Provably good global buffering using an available buffer block plan

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
An O(nlogn) time algorithm for optimal buffer insertion

Proceedings of the 40th annual Design Automation Conference
Interconnect-Dominated VLSI Design

ARVLSI '99 Proceedings of the 20th Anniversary Conference on Advanced Research in VLSI
Web page feature selection and classification using neural networks

Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Power macromodeling of global interconnects considering practical repeater insertion

Proceedings of the 14th ACM Great Lakes symposium on VLSI
Practical repeater insertion for low power: what repeater library do we need?

Proceedings of the 41st annual Design Automation Conference
Efficient algorithms for buffer insertion in general circuits based on network flow

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Design and verification of high-speed VLSI physical design

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

As devices and lines shrink into the deep submicron range, the propagation delay of signals can be effectively improved by repowering the signals using intermediate buffers placed within the routing trees. Almost no existing timing driven floorplanning and placement approaches consider the option of buffer insertion. As such, they may exclude solutions, particularly early in the design process, with smaller overall area and better routability. In this paper, we propose a new methodology in which buffered trees are used to estimate wire delay during floorplanning. Instead of treating delay as one of the objectives, as done by the majority of previous work, we formulate the problem in terms of Delay Bounded Buffered Trees (DBB-tree) and propose an efficient algorithm to construct a DBB spanning tree for use during floorplanning. Experimental results show that the algorithm is very effective. Using buffer insertion at the floorplanning stage yields significantly better solutions in terms of both chip area and total wire length.