Detailed Placement and Global Routing Co-Optimization with Complex Constraints
With several divided stages, placement and routing are the most critical and challenging steps in VLSI physical design. To ensure that physical implementation problems can be manageable and converged in a reasonable runtime, placement/routing problems are usually further split into several sub-probl...
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-12-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/11/1/51 |
| _version_ | 1797499280111435776 |
|---|---|
| author | Zhipeng Huang Haishan Huang Runming Shi Xu Li Xuan Zhang Weijie Chen Jiaxiang Wang Ziran Zhu |
| author_facet | Zhipeng Huang Haishan Huang Runming Shi Xu Li Xuan Zhang Weijie Chen Jiaxiang Wang Ziran Zhu |
| author_sort | Zhipeng Huang |
| collection | DOAJ |
| description | With several divided stages, placement and routing are the most critical and challenging steps in VLSI physical design. To ensure that physical implementation problems can be manageable and converged in a reasonable runtime, placement/routing problems are usually further split into several sub-problems, which may cause conservative margin reservation and mis-correlation. Therefore, it is desirable to design an algorithm that can accurately and efficiently consider placement and routing simultaneously. In this paper, we propose a detailed placement and global routing co-optimization algorithm while considering complex routing constraints to avoid conservative margin reservation and mis-correlation in placement/routing stages. Firstly, we present a rapidly preprocessing technology based on R-tree to improve the initial routing results. After that, a BFS-based approximate optimal addressing algorithm in 3D is designed to find a proper destination for cell movement. We propose an optimal region selection algorithm based on the partial routing solution to jump out of the local optimal solution. Further, a fast partial net rip-up and rerouted algorithm is used in the process of cell movement. Finally, we adopt an efficient refinement technique to reduce the routing length further. Compared with the top 3 winners according to the 2020 ICCAD CAD contest benchmarks, the experimental results show that our algorithm achieves the best routing length reduction for all cases with a shorter runtime. On average, our algorithm can improve 0.7%, 1.5%, and 1.7% for the first, second, and third place, respectively. In addition, we can still obtain the best results after relaxing the maximum cell movement constraint, which further illustrates the effectiveness of our algorithm. |
| first_indexed | 2024-03-10T03:45:11Z |
| format | Article |
| id | doaj.art-3313af9f11024978bc7133aa61a194a3 |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-10T03:45:11Z |
| publishDate | 2021-12-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-3313af9f11024978bc7133aa61a194a32023-11-23T11:22:08ZengMDPI AGElectronics2079-92922021-12-011115110.3390/electronics11010051Detailed Placement and Global Routing Co-Optimization with Complex ConstraintsZhipeng Huang0Haishan Huang1Runming Shi2Xu Li3Xuan Zhang4Weijie Chen5Jiaxiang Wang6Ziran Zhu7Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou 350108, ChinaCollege of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, ChinaState Key Laboratory of ASIC & System, Fudan University, Shanghai 200433, ChinaCollege of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, ChinaCollege of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, ChinaCollege of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, ChinaCollege of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, ChinaNational ASIC System Engineering Center, Southeast University, Nanjing 210096, ChinaWith several divided stages, placement and routing are the most critical and challenging steps in VLSI physical design. To ensure that physical implementation problems can be manageable and converged in a reasonable runtime, placement/routing problems are usually further split into several sub-problems, which may cause conservative margin reservation and mis-correlation. Therefore, it is desirable to design an algorithm that can accurately and efficiently consider placement and routing simultaneously. In this paper, we propose a detailed placement and global routing co-optimization algorithm while considering complex routing constraints to avoid conservative margin reservation and mis-correlation in placement/routing stages. Firstly, we present a rapidly preprocessing technology based on R-tree to improve the initial routing results. After that, a BFS-based approximate optimal addressing algorithm in 3D is designed to find a proper destination for cell movement. We propose an optimal region selection algorithm based on the partial routing solution to jump out of the local optimal solution. Further, a fast partial net rip-up and rerouted algorithm is used in the process of cell movement. Finally, we adopt an efficient refinement technique to reduce the routing length further. Compared with the top 3 winners according to the 2020 ICCAD CAD contest benchmarks, the experimental results show that our algorithm achieves the best routing length reduction for all cases with a shorter runtime. On average, our algorithm can improve 0.7%, 1.5%, and 1.7% for the first, second, and third place, respectively. In addition, we can still obtain the best results after relaxing the maximum cell movement constraint, which further illustrates the effectiveness of our algorithm.https://www.mdpi.com/2079-9292/11/1/51electronic design automationdetailed placementglobal routing |
| spellingShingle | Zhipeng Huang Haishan Huang Runming Shi Xu Li Xuan Zhang Weijie Chen Jiaxiang Wang Ziran Zhu Detailed Placement and Global Routing Co-Optimization with Complex Constraints Electronics electronic design automation detailed placement global routing |
| title | Detailed Placement and Global Routing Co-Optimization with Complex Constraints |
| title_full | Detailed Placement and Global Routing Co-Optimization with Complex Constraints |
| title_fullStr | Detailed Placement and Global Routing Co-Optimization with Complex Constraints |
| title_full_unstemmed | Detailed Placement and Global Routing Co-Optimization with Complex Constraints |
| title_short | Detailed Placement and Global Routing Co-Optimization with Complex Constraints |
| title_sort | detailed placement and global routing co optimization with complex constraints |
| topic | electronic design automation detailed placement global routing |
| url | https://www.mdpi.com/2079-9292/11/1/51 |
| work_keys_str_mv | AT zhipenghuang detailedplacementandglobalroutingcooptimizationwithcomplexconstraints AT haishanhuang detailedplacementandglobalroutingcooptimizationwithcomplexconstraints AT runmingshi detailedplacementandglobalroutingcooptimizationwithcomplexconstraints AT xuli detailedplacementandglobalroutingcooptimizationwithcomplexconstraints AT xuanzhang detailedplacementandglobalroutingcooptimizationwithcomplexconstraints AT weijiechen detailedplacementandglobalroutingcooptimizationwithcomplexconstraints AT jiaxiangwang detailedplacementandglobalroutingcooptimizationwithcomplexconstraints AT ziranzhu detailedplacementandglobalroutingcooptimizationwithcomplexconstraints |