IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1995 · 152 citations · 31 references
EngineeringComputer ScienceElectrical EngineeringCircuit TheoryInterconnection NetworksOptimizationDelay ModelingInterconnect DesignRoutingRouting AlgorithmsRouting ArchitectureTiming AnalysisArea-delay TradeoffsInterconnect DelayInterconnect Delay AnalysisInterconnect Delay ModelingInterconnect Delay OptimizationInterconnect OptimizationInterconnect RoutingTree Structures
In this paper, we study the optimal wiresizing problem under the Elmore delay model. We show that the optimal wiresizing solutions satisfy a number of interesting properties, including the separability, the monotone property, and the dominance property. Based on these properties, we have developed a polynomial-time optimal wiresizing algorithm for arbitrary interconnect tree structures under Elmore delay model. Extensive experimental results have shown that our wiresizing solution reduces interconnect delay by up to 51% when compared to the uniform-width solution of the same routing topology. Furthermore, compared to the wiresizing solution based on a simpler RC delay model our wiresizing solution reduces the total wiring area by up to 28% while further reducing the interconnect delays to the timing-critical sinks by up to 12%.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
31