Buffer block planning for interconnect-driven floorplanning
Published 7 November 1999
Jason Cong, Tianming Kong, David Z. Pan
Citations146
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This paper studies buffer block planning for interconnect-driven floorplanning in deep submicron designs. We first introduce the concept of feasible region (FR) for buffer insertion, and derive closed-form formula for FR. We observe that the FR for a buffer is quite large in general even under fairly tight delay constraint. Therefore, FR gives us a lot of flexibility to plan for buffer locations. We then develop an effective buffer block planning (BBP) algorithm to perform buffer clustering such that the overall chip area and the buffer block number can be minimized. To the best of our knowledge, this is the first in-depth study on buffer planning for interconnect-driven floorplanning with both area and delay consideration.
Keywords
Computer ScienceEngineering
Buffer placement in distributed RC-tree networks for minimal Elmore delay
558 Citations2002L. P. P. P. van Ginneken
An algorithm is presented for choosing the buffer positions for a wiring tree such that the Elmore delay is minimal, and an extension of the basic algorithm allows minimization of the number of buffers as a secondary objective.
International Conference on Computer Aided DesignRectangle-packing-based module placement
369 Citations1995Hiroshi Murata, Kunihiro Fujiyoshi +2 more
IntegrationPerformance optimization of VLSI interconnect layout
335 Citations1996Jason Cong, Lei He +2 more
A comprehensive survey of existing techniques for interconnect optimization during the VLSI physical design process, with emphasis on recent studies on interconnect design and optimization for high-performance V LSI circuit design under the deep submicron fabrication technologies.
IEEE Journal of Solid-State CircuitsOptimal wire sizing and buffer insertion for low power and a generalized delay model
236 Citations1996John Lillis, Chung‐Kuan Cheng +1 more
Wire segmenting for improved buffer insertion
205 Citations1997Charles J. Alpert, Anirudh Devgan
Weshow that using wire segmenting as a precursor to buffer insertion produces solutions within a few percent of optimal, while using only seconds of CPU time is shown.
Interconnect design for deep submicron ICs
152 Citations1997Jason Cong, Zhigang Pan +3 more
This embedded tutorial discusses the trends and challenges of interconnect design as the technology feature size rapidly decreases towards below 0.1 micron, and presents commonly used interconnect models and a set of interConnect design and optimization techniques for improving interconnect performance and reliability.
Challenges and Opportunities for Design Innovations in Nanometer Technologies
131 Citations1998Jason Cong
The challenges and opportunities for design innovations in the future IC designs, especially in the areas of interconnect design and high-degree of on-chip integration are discussed, with quantitative measurements derived based on the technology projection in NTRS’97.
International Conference on Computer Aided DesignBuffered Steiner tree construction with wire sizing for interconnect layout optimization
119 Citations1996Takumi Okamoto, Jason Cong
Closed form solution to simultaneous buffer insertion/sizing and wire sizing
94 Citations1997Chris Chu, Martin D. F. Wong
This paper considers the delay minimization problem of an interconnect wire by simultaneously considering buffer insertion, buffer sizing and wire sizing and provides elegant closed form optimal solutions for all three problems.
AlgorithmicaFloorplan design of VLSI circuits
74 Citations1989Martin D. F. Wong, C. L. Liu
This paper presents two algorithms for the floorplan design problem that use Polish expressions to represent floorplans and employ the search method of simulated annealing.
Global wires: harmful?
66 Citations1998Ralph H. J. M. Otten
In this paper a shift is proposed in the design of vlsi circuits, in conventional design higher levels of synthesis have to deliver a gate and net list, from which layout synthesis has to built a mask specification for manufacturing.
Interconnect delay estimation models for synthesis and design planning
60 Citations1999Jason Cong, David Z. Pan
A set of interconnect delay estimation models with consideration of various layout optimizations, including optimal wire-sizing (OWS), simultaneous driver and wire sizing (SDWS), and simultaneous buffer insertion/sizing and wire sized (BISWS), are developed.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and SystemsHierarchical placement and floorplanning in BEAR
53 Citations1989W.W.-M. Dai
The algorithm combines the goal orientation of top-down approaches with the block orientation of bottom-up techniques, resulting in a meet-in-the-middle strategy that considers the mutual dependency between placement and routing explicitly by incorporating a novel method of hierarchical routing area estimation.
An interconnect-centric design flow for nanometer technologies
51 Citations2003J. Cong
This paper presents the ongoing research effort at UCLA to develop an interconnect-centric design flow, including interconnect planning, interconnect synthesis, and interconnect layout, which allows interconnect design and optimization to be properly considered at every level of the design process.
International Journal of Circuit Theory and ApplicationsGraphs in floor‐plan design
26 Citations1988Ralph H. J. M. Otten
Graph models play an important role in floor-plan design and the implications of structural restraints for the models as well as for the applications, geometrical optimization and global routing in particular.
Delay bounded buffered tree construction for timing driven floorplanning
23 Citations1997Kang, Dai +2 more
This paper forms the problem in terms of delay bounded buffered trees (DBB-tree) and proposes an efficient algorithm to construct a DBB spanning tree for use during floorplanning and results show that the algorithm is very effective.
International Conference on Computer Aided DesignDelay bounded buffered tree construction for timing driven floorplanning
22 Citations1997Maggie Kang, Wayne W.-M. Dai +2 more
Relaxed simulated tempering for VLSI floorplan designs
17 Citations1999Jason Cong, Tianming Kong +4 more
This paper has successfully applied a version of relaxed simulated tempering to slicing floorplan design with consideration of both area and wirelength optimization.