Parallel AIG Refactoring via Conflict Breaking
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914764025757696 |
|---|---|
| author | Cai, Ye Yang, Zonglin Ni, Liwei Liu, Junfeng Xie, Biwei Li, Xingquan |
| author_facet | Cai, Ye Yang, Zonglin Ni, Liwei Liu, Junfeng Xie, Biwei Li, Xingquan |
| contents | Algorithm parallelization to leverage multi-core platforms for improving the efficiency of Electronic Design Automation~(EDA) tools plays a significant role in enhancing the scalability of Integrated Circuit (IC) designs. Logic optimization is a key process in the EDA design flow to reduce the area and depth of the circuit graph by finding logically equivalent graphs for substitution, which is typically time-consuming. To address these challenges, in this paper, we first analyze two types of conflicts that need to be handled in the parallelization framework of refactoring And-Inverter Graph~(AIG). We then present a fine-grained parallel AIG refactoring method, which strikes a balance between the degree of parallelism and the conflicts encountered during the refactoring operations. Experiment results show that our parallel refactor is 28x averagely faster than the sequential algorithm on large benchmark tests with 64 physical CPU cores, and has comparable optimization quality. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_13617 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Parallel AIG Refactoring via Conflict Breaking Cai, Ye Yang, Zonglin Ni, Liwei Liu, Junfeng Xie, Biwei Li, Xingquan Distributed, Parallel, and Cluster Computing Algorithm parallelization to leverage multi-core platforms for improving the efficiency of Electronic Design Automation~(EDA) tools plays a significant role in enhancing the scalability of Integrated Circuit (IC) designs. Logic optimization is a key process in the EDA design flow to reduce the area and depth of the circuit graph by finding logically equivalent graphs for substitution, which is typically time-consuming. To address these challenges, in this paper, we first analyze two types of conflicts that need to be handled in the parallelization framework of refactoring And-Inverter Graph~(AIG). We then present a fine-grained parallel AIG refactoring method, which strikes a balance between the degree of parallelism and the conflicts encountered during the refactoring operations. Experiment results show that our parallel refactor is 28x averagely faster than the sequential algorithm on large benchmark tests with 64 physical CPU cores, and has comparable optimization quality. |
| title | Parallel AIG Refactoring via Conflict Breaking |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2404.13617 |