Timing driven placement using physical net constraints

Bill Halpin, C. Y.Roger Chen, Naresh Sehgal

Research output: Contribution to journalArticlepeer-review

50 Scopus citations

Abstract

This paper presents a new timing driven placement algorithm that explicitly meets physical net lengths constraints. It is the first recursive bi-section placement (RBP) algorithm that meets precise half perimeter bounding box constraints on critical nets. At each level of the recursive bi-section, we use linear programming to ensure that all net constraints are met. Our method can easily be incorporated with existing RBP methods. We use the net constraint based placer to improve timing results by setting and meeting constraints on timing critical nets. We report significantly better timing results on each of the MCNC benchmarks and achieve an average optimization exploitation of 69% versus previously reported 53%.

Original languageEnglish (US)
Pages (from-to)780-783
Number of pages4
JournalProceedings - Design Automation Conference
DOIs
StatePublished - Jan 1 2001

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Timing driven placement using physical net constraints'. Together they form a unique fingerprint.

Cite this