Congestion driven quadratic placement

  • Authors:
  • Phiroze N. Parakh;Richard B. Brown;Karem A. Sakallah

  • Affiliations:
  • University Of Michigan, 1301 Beal Ave, EECS - ACAL, Ann Arbor, MI;University Of Michigan, 1301 Beal Ave, EECS - ACAL, Ann Arbor, MI;University Of Michigan, 1301 Beal Ave, EECS - ACAL, Ann Arbor, MI

  • Venue:
  • DAC '98 Proceedings of the 35th annual Design Automation Conference
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces and demonstrates an extension to quadratic placement that accounts for wiring congestion. The algorithm uses an A* router and line-probe heuristics on region-based routing graphs to compute routing cost. The interplay between routing analysis and quadratic placement using a growth matrix permits global treatment of congestion. Further reduction in congestion is obtained by the relaxation of pin constraints. Experiments show improvements in wireability.