Abstract
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.
Original language | English (US) |
---|---|
Pages | 122-127 |
Number of pages | 6 |
DOIs | |
State | Published - 2000 |
Event | ISPD-2000: International Symposium on Physical Design - San Diego, CA, USA Duration: Apr 9 2000 → Apr 12 2000 |
Conference
Conference | ISPD-2000: International Symposium on Physical Design |
---|---|
City | San Diego, CA, USA |
Period | 4/9/00 → 4/12/00 |