Datapath routing based on a decongestion metric

For a four-layer datapath routing environment, we present an algorithm that considers all the nets simultaneously. Routing probabilities are calculated for potential routing regions and consolidated into a congestion metric. This is followed by an iterative diversion technique where the region with the maximum congestion metric is repetitively relaxed until the track probabilities crystallize into integer values of 1 and 0. We have run the algorithm on large test cases and achieved significant routability within a small number of available tracks.

• Type: Conference
• Year: 2000
• Where: ISPD
• Authors: Suresh Raman, Sachin S. Sapatnekar, Charles J. Alpert
• Keywords: Congestion Metric, Datapath Routing Environment, Hardware, ISPD 2000, Potential Routing Regions