IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 2002 · 137 citations · 12 references
ComputingComputer EngineeringInterconnection NetworksPerformance-based DesignSimulation-based DesignCongestion ControlCongestion ManagementNetwork Performance AnalysisRoutingRouting AlgorithmsCongestion AnalysisCongestion EstimationCongestion ModellingInterconnect Congestion AnalysisInterconnect RoutingNet Count EstimationRouting CongestionRouting Congestion Analysis
Design routability is a major concern in the application-specific design flow, particularly with today's increasingly aggressive process technology nodes. Increased die areas, cell densities, routing layers, and net count all contribute to complex interconnect requirements, which can significantly deteriorate performance and sometimes lead to unroutable solutions. Congestion analysis and optimization must be performed early in the design cycle to improve routability. This paper presents a congestion estimation algorithm for a placed net list. We propose a net-based stochastic model for computing expected horizontal and vertical track usage, which considers routing blockages. The main advantages of this algorithm are its accuracy and fast runtime. We show that the congestion estimated by this algorithm correlates well with postroute congestion and present experimental results of subsequent congestion minimization based on this algorithm.
12
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Congestion driven quadratic placement
Phiroze N. Parakh, Richard B. Brown, Karem A. Sakallah · 1998 · 100 citations