IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1999 · 48 citations · 24 references
EngineeringComputer EngineeringComputer ScienceCircuit TheoryComputer NetworksInterconnection NetworksBuffer ManagementInterconnect ArchitectureInterconnect DesignRoutingRouting AlgorithmsTiming AnalysisDelay MinimizationInterconnect DelayInterconnect Delay AnalysisInterconnect Delay ModelingInterconnect Delay OptimizationInterconnect OptimizationPolynomial-time AlgorithmsWire Sizing
In this paper, we consider the problem of interconnect delay minimization by simultaneous buffer and wire sizing under the Elmore delay model. We first present a polynomial time algorithm SBWS to minimize the delay of an interconnect wire. Previously, no polynomial time algorithm for the problem has been reported in the literature. SBWS is an iterative algorithm with guaranteed convergence to the optimal solution. It runs in quadratic time and uses constant memory for computation. Experimental results show that SBWS is extremely efficient in practice. For example, for an interconnect of 10000 segments and buffers, the CPU time is only 0.255 s. We then extend our result to handle interconnect trees. We present an algorithm SBWS-T which always gives the optimal solution. Experimental results show that SBWS-T is faster than the greedy wire sizing algorithm in practice.
24
Performance optimization of VLSI interconnect layout
Jason Cong, Lei He, Cheng‐Kok Koh et al. · Integration · 1996 · 337 citations
Engineering, Computer Engineering, Electrical Engineering +12
Interconnect design for deep submicron ICs
Jason Cong, Zhigang Pan, Lei He et al. · 1997 · 152 citations
Engineering, Computer Engineering, Electrical Engineering +17