Results 1  10
of
10
Performance optimization of VLSI interconnect layout
 Integration, the VLSI Journal
, 1996
"... This paper presents 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 highperformance VLSI circuit design under the deep submicron fabrication technologies. ..."
Abstract

Cited by 103 (32 self)
 Add to MetaCart
This paper presents 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 highperformance VLSI circuit design under the deep submicron fabrication technologies. First, we present a number of interconnect delay models and driver/gate delay models of various degrees of accuracy and efficiency which are most useful to guide the circuit design and interconnect optimization process. Then, we classify the existing work on optimization of VLSI interconnect into the following three categories and discuss the results in each category in detail: (i) topology optimization for highperformance interconnects, including the algorithms for total wire length minimization, critical path length minimization, and delay minimization; (ii) device and interconnect sizing, including techniques for efficient driver, gate, and transistor sizing, optimal wire sizing, and simultaneous topology construction, buffer insertion, buffer and wire sizing; (iii) highperfbrmance clock routing, including abstract clock net topology generation and embedding, planar clock routing, buffer and wire sizing for clock nets, nontree clock routing, and clock schedule optimization. For each method, we discuss its effectiveness, its advantages and limitations, as well as its computational efficiency. We group the related techniques according to either their optimization techniques or optimization objectives so that the reader can easily compare the quality and efficiency of different solutions.
Equivalent Elmore Delay for RLC Trees
 Proceedings of the ACM/IEEE Design Automation Conference
, 2000
"... Abstract—Closedform solutions for the 50 % delay, rise time, overshoots, and settling time of signals in an tree are presented. These solutions have the same accuracy characteristics of the Elmore delay for trees and preserves the simplicity and recursive characteristics of the Elmore delay. Specif ..."
Abstract

Cited by 30 (8 self)
 Add to MetaCart
Abstract—Closedform solutions for the 50 % delay, rise time, overshoots, and settling time of signals in an tree are presented. These solutions have the same accuracy characteristics of the Elmore delay for trees and preserves the simplicity and recursive characteristics of the Elmore delay. Specifically, the complexity of calculating the time domain responses at all the nodes of an tree is linearly proportional to the number of branches in the tree and the solutions are always stable. The closedform expressions introduced here consider all damping conditions of an circuit including the underdamped response, which is not considered by the Elmore delay due to the nonmonotone nature of the response. The continuous analytical nature of the solutions makes these expressions suitable for design methodologies and optimization techniques. Also, the solutions have significantly improved accuracy as compared to the Elmore delay for an overdamped response. The solutions introduced here for trees can be practically used for the same purposes that the Elmore delay is used for trees.
Simultaneous buffer and wire sizing for performance and power optimization
 in Proc. Int. Symp. on Low Power Electronics and Design
, 1996
"... ..."
Tsao,“Practical BoundedSkew Clock Routing
 J. VLSI Signal Proc
"... Abstract: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, risetime and overshoot constraints, obstacle and legal locationchecking, varying layer parasitics and congestion, and even the underl ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, risetime and overshoot constraints, obstacle and legal locationchecking, varying layer parasitics and congestion, and even the underlying design flow are often ignored. This paper explores directions in which traditional formulations can be extended so that the resulting algorithms are more useful in production design environments. Specifically, the following issues are addressed: (i) clock routing for varying layer parasitics with nonzero via parasitics; (ii) obstacleavoidance clock routing; (iii) a new topology design rule for prescribeddelay clock routing; and (iv) predictive modeling of the clock routing itself. We develop new theoretical analyses and heuristics, and present experimental results that validate our new approaches. 1
Minimizing Wirelength in Zero and Bounded Skew Clock Trees
 Proc. ACM/SIAM Symp. on Discrete Algorithms
, 1999
"... An important problem in VLSI design is distributing a clock signal to synchronous elements in a VLSI circuit so that the signal arrives at all elements simultaneously. The signal is distributed by means of a clock routing tree rooted at a global clock source. The difference in length between the l ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
An important problem in VLSI design is distributing a clock signal to synchronous elements in a VLSI circuit so that the signal arrives at all elements simultaneously. The signal is distributed by means of a clock routing tree rooted at a global clock source. The difference in length between the longest and shortest rootleaf path is called the skew of the tree. The problem is to construct a clock tree with zero skew (to achieve synchronicity) and minimal sum of edge lengths (so that circuit area and clock tree capacitance are minimized). We give the first constantfactor approximation algorithms for this problem and its variants that arise in the VLSI context. For the zero skew problem in general metric spaces, we give an approximation algorithm with a performance guarantee of 2e. For the L 1 version on the plane, we give an (8/ ln 2) approximation algorithm. 1 Introduction. A fundamental problem in VLSI design is clock routing, i.e., distributing a clock signal to synchro...
PlanarDME: A singlelayer zeroskew clock tree router
 IEEE Trans. Comput. Aid. Des. Integ. Circ. Syst
, 1996
"... This paper presents new singlelayer, i.e., planarembeddable, clock tree constructions with exact zero skew under either the linear or the Elmore delay model. Our method, called PlanarDME, consists of two parts. The rst algorithm, calledLinearPlanarDME, guarantees an optimal planar zeroskew clo ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
This paper presents new singlelayer, i.e., planarembeddable, clock tree constructions with exact zero skew under either the linear or the Elmore delay model. Our method, called PlanarDME, consists of two parts. The rst algorithm, calledLinearPlanarDME, guarantees an optimal planar zeroskew clock tree (ZST) under the linear delay model. The second algorithm, called ElmorePlanarDME, uses the LinearPlanarDME connection topology in constructing a lowcost ZST according to the Elmore delaymodel. While a planar ZST under the linear delay model is easily converted to a planar ZST under the Elmore model by elongating tree edges in bottomup order, our key idea is to avoid unneeded wire elongation by iterating the DME construction of ZST and the bottomup modi cation of the resulting nonplanar routing. Costs of our planar ZST solutions are comparable to those of the best previous nonplanar ZST solutions, and substantially improve over previous planar clock routing methods. 1
A DeepSubmicron Steiner Tree
"... . ATree is a rectilinear Steiner tree in which every sink is connected to a driver by a shortest length path, while simultaneously minimizing total wire length. This paper presents a polynomial approximation algorithm for the generalized version of ATree problem with upperbounded delays along eac ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. ATree is a rectilinear Steiner tree in which every sink is connected to a driver by a shortest length path, while simultaneously minimizing total wire length. This paper presents a polynomial approximation algorithm for the generalized version of ATree problem with upperbounded delays along each path from the driver to the sinks and with restrictions on the number of Steiner nodes. We refer to it as "Deepsubmicron Steiner tree" as minimizing the number of Steiner nodes is crucial for signal integrity issues in deepsubmicron verylargescaledintegratedcircuit (VLSI) designs. The idea behind the algorithm is to control two parameters in order to construct a feasible (with respect to the paths delays and the number of Steiner nodes) tree of small cost. The simulation results show the high efficiency of our approach. 1 Introduction With the scaling of device technology to deep submicron dimension, gate delay is getting faster by device scaling factor S and scaled wires increase d...
BoundedSkew Clock and Steiner Routing Under Elmore Delay
, 1995
"... : We study the minimumcost boundedskew routing tree problem under the Elmore delay model. We present two approaches to construct boundedskew routing trees: (i) the Boundary Merging and Embedding (BME) method which utilizes merging points that are restricted to the boundariesof merging regions, an ..."
Abstract
 Add to MetaCart
: We study the minimumcost boundedskew routing tree problem under the Elmore delay model. We present two approaches to construct boundedskew routing trees: (i) the Boundary Merging and Embedding (BME) method which utilizes merging points that are restricted to the boundariesof merging regions, and (ii) the Interior Merging and Embedding (IME) algorithm which employs a sampling strategy and dynamic programming to consider merging points that are interior to, rather than on the boundary of, the merging regions. Our new algorithms allow accurate control of Elmore delay skew, and show the utility of merging points inside merging regions. 1 Introduction Control of signal delay is important in layout synthesis of high performance systems. Recent works on clock routing have accomplished exact zero skew under the Elmore delay model [17, 5, 11], and given new singlelayer (planar) constructions [18, 15, 16]. A detailed review of clock tree and Steiner routing algorithms is given in [14]. ...
More Practical BoundedSkew Clock Routing
 Proceedings of 34th ACM/IEEE Design Automation Conference
, 1997
"... : Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, risetime and overshoot constraints, obstacle and legal locationchecking, varying layer parasitics and congestion, and even the underlying des ..."
Abstract
 Add to MetaCart
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, risetime and overshoot constraints, obstacle and legal locationchecking, varying layer parasitics and congestion, and even the underlying design flow are often ignored. This paper explores directions in which traditional formulations can be extended so that the resulting algorithms are more useful in production design environments. Specifically, the following issues are addressed: (i) clock routing for varying layer parasitics with nonzero via parasitics; (ii) obstacleavoidance clock routing; (iii) a new topology design rule for prescribeddelay clock routing; and (iv) predictive modeling of the clock routing itself. We develop new theoretical analyses and heuristics, and present experimental results that validate our new approaches. 1 Preliminaries Control of signal delay skew has become a dominant objective in the routing of...
Algorithm, Design
"... Link based nontree clock network is an effective and economic way to reduce clock skew caused by variations. However, it is still an open topic where links should be inserted in order to achieve largest skew reduction with smaller extra resources. We propose a new method using linear program to sol ..."
Abstract
 Add to MetaCart
Link based nontree clock network is an effective and economic way to reduce clock skew caused by variations. However, it is still an open topic where links should be inserted in order to achieve largest skew reduction with smaller extra resources. We propose a new method using linear program to solve this problem in this paper. In our approach, clock skew in a nontree clock network is computed using the delay model in [13] and the information is used to select the node pairs for link insertion. Tradeoff between crosslink length and skew reduction effect is explored. Based on the analysis, we propose a new algorithm to insert crosslinks into a clock network. We compare our work with the method in [1] and a recent work [4] which inserts links between internal nodes of a tree. Experiments show that our method can reduce skew under variations effectively.