Shih-Lian T. Ou

Learn More
This paper presents a partitioning-based, timing-driven placementalgorithm. The partitioning step itself is timing-driven and basedon solving a quadratic programming problem iteratively. Theplacement algorithm does not rely on interleaved timingcalculations, which tend to be inaccurate. Instead, it achieves thedesired result by controlling the number of(More)
  • 1