An effective clustering algorithm for mixed-size placement

  • Authors:
  • Jianhua Li;Laleh Behjat;Jie Huang

  • Affiliations:
  • University of Calgary, Calgary, AB, Canada;University of Calgary, Calgary, AB, Canada;University of Calgary, Calgary, AB, Canada

  • Venue:
  • Proceedings of the 2007 international symposium on Physical design
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Placement is a crucial step for the VLSI circuit physical design and it has a deep impact on the overall circuit performance. Numerous clustering techniques have been proposed and applied to placement to deal with the increasing circuit sizes and complexity. In this paper, an effective clustering algorithm for mixed-size placement is presented. This technique uses local cell connectivity information to identify all potential clusters, but finalizes clusters globally. The effectiveness of the proposed clustering technique is verified by empirical tests on ICCAD04 and ISPD05 benchmark circuits. Specifically, 4 major academic placers, including Capo10.1, FengShui5.1, mPL6 and NTUPlace3-LE, are tested by using the proposed clustering technique as a preprocessing step. The overall experimental results show that for ICCAD04 benchmarks, the proposed clustering technique consistently improves all of the placers' performance by 2% to 5% on average in term of the pin-to-pin half perimeter wire length, with comparable or lower runtime. For ISPD05 benchmarks, the proposed clustering technique shows promising results.