Abstract

Clustering algorithms have been used to improve the speed and quality of placement. Traditionally, clustering focuses on the local connections between cells. In this paper, a new clustering algorithm that is based on the estimated lengths of circuit interconnects and the connectivity is proposed. In the proposed algorithm, first an a priori length estimation technique is used to estimate the lengths of nets. Then, the estimated lengths are used in a clustering framework to modify a clustering technique based on algebraic multigrid (AMG), that finds the cells with the highest connectivity. Finally, based on the results from the AMG‐based process, clusters are made. In addition, a new physical unclustering technique is proposed. The results show a significant improvement, reductions of up to 40%, in wire length can be achieved when using the proposed technique with three academic placers on industry‐based circuits. Moreover, the runtime is not significantly degraded and can even be improved.

Highlights

  • A New Length-Based Algebraic Multigrid Clustering Algorithm“A New Length-Based Algebraic Multigrid Clustering Algorithm,” VLSI Design, vol 2012, Article ID 395260, 14 pages, 2012

  • Clustering is usually employed during the large-scale place­ ment problems encountered in today’s circuits, to speed up the placement process and improve the solution quality

  • The clustering algorithms used today are based on finding small groups of cells with high connectivity and putting each of them in a cluster

Read more

Summary

A New Length-Based Algebraic Multigrid Clustering Algorithm

“A New Length-Based Algebraic Multigrid Clustering Algorithm,” VLSI Design, vol 2012, Article ID 395260, 14 pages, 2012. Clustering algorithms have been used to improve the speed and quality of placement. A new clustering algorithm that is based on the estimated lengths of circuit interconnects and the connectivity is proposed. First an a priori length estimation technique is used to estimate the lengths of nets. The estimated lengths are used in a clustering framework to modify a clustering technique based on algebraic multigrid (AMG), that finds the cells with the highest connectivity. The results show a significant improvement, reductions of up to 40%, in wire length can be achieved when using the proposed technique with three academic placers on industry-based circuits. The runtime is not significantly degraded and can even be improved

Introduction
Background
The Proposed Length-Driven Multilevel Placement Framework
Experimental Results
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.