A Multi-Objective Optimization Algorithm Based on Deep Learning for Circuit Partition
Bibliographic record
Abstract
Circuit partition is a critical step during Three-dimensional integrated circuit(3D IC) physical design. The quality of circuit partition directly affects the subsequent processes(placement, clock-tree synchronization, route, etc.). Circuit partition is the process that divides a circuit composed of logic gates into subsets with the objective of minimizing the inter connection of subsets and balancing the sum of modules weights between subsets. It can be modeled as a graph partition problem, which is known to be NP-hard. Compared with the traditional graph partition problem, in order to make full use of the space resources of 3D chips, circuit partition pays more attention to the balance between subsets. In this paper, we propose a deep learning-based multi-objective optimization algorithm. Our algorithm uses multiple branch feature extractors(based on GraphSAGE) to learn the features and topological relationships of nodes, and then generates node embedding. Finally, our algorithm obtains the circuit partitioning strategy by using node allocator(based on FC). Compared to the state-of-the-art graph partition(metis), our algorithm improves the balance of partition(2×), and slightly reduces cut-edge quality.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".