Datapath routing based on a decongestion metric

Suresh Raman, Sachin S. Sapatnekar, Charles J. Alpert

Research output: Contribution to conferencePaperpeer-review

7 Scopus citations


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 languageEnglish (US)
Number of pages6
StatePublished - 2000
EventISPD-2000: International Symposium on Physical Design - San Diego, CA, USA
Duration: Apr 9 2000Apr 12 2000


ConferenceISPD-2000: International Symposium on Physical Design
CitySan Diego, CA, USA


Dive into the research topics of 'Datapath routing based on a decongestion metric'. Together they form a unique fingerprint.

Cite this