Learning Based Placement Refinement to Reduce DRC Short Violations
| Autor: | Chang-Tzu Lin, Ying-Yao Huang, Wei-Lun Liang, Hung-Ming Chen |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Very-large-scale integration
Prediction algorithms Computer science Distributed computing Routing congestion Hardware_INTEGRATEDCIRCUITS 0202 electrical engineering electronic engineering information engineering Learning based 02 engineering and technology Routing (electronic design automation) 020202 computer hardware & architecture |
| Zdroj: | VLSI-DAT |
| Popis: | With the increasing complexity of the design rules, the routability has become one of the most essential factors that should be considered in the placement stage; however, being the routable basis of the placer in the past, the congestion map given by global routing cannot display the trend of routabiliy nowadays. If we want more comprehensive and close to the actual routing information, we must execute the complete flow including global routing and detailed routing, which is time-consuming. Therefore, how to access the accurate routing information rapidly is an important issue.This paper proposes a machine learning method and put it into our placement flow to help us solve the above problem. In this machine learning model, the features contain the information of placement itself and the global routing congestion. We utilize the model to predict the position of the detailed routing violations and feed the information back to placement system, and generate a new placement result afterwards. Experimental results show that comparing with the result of the original placer, the proposed methodologies can effectively decrease the number of the DRC violations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|