22 September 2023 in IEEE Transactions on Circuits and Systems II: Express Briefs
With the vertically stacked configuration and different technology processes imposed by stacked three-dimensional (3D) integration circuits (ICs), the placement problem has become more challenging. In this brief, we develop a high-performance 3D placement engine with physical-aware incremental partitioning for the stacked 3D ICs. We first propose a compact 2D global placement (GP) to find desired locations for all cells in a die, and then present a progressive density-driven partitioning to partition the netlist into two dies. After that, we propose an incremental half-perimeter wirelength (HPWL)-driven partitioning and a 3D GP to alternately optimize the partitioning and placement results. Finally, we present legalization and detailed placement methods to ensure the legality and further improve the solution. Compared with the top 3 teams of the ICCAD 2022 contest, experimental results on the contest benchmarks show that our algorithm achieves the best solution quality for every benchmark in a comparable runtime.
17 August 2023 in IEEE Transactions on Circuits and Systems II: Express Briefs
To reduce the design complexity of physical design, placement and routing are commonly regarded as two problems. However, since the correlation and aims of placement and routing are not totally consistent, the complete separation of the two stages might limit the final routing quality. To narrow the gap between the two stages and improve the routing solution, this brief proposes an effective routing refinement algorithm based on incremental replacement and rerouting. We first propose an R-tree-based parallel net rerouting scheme to remove redundant routing segments, which offers more precise information for the subsequent cell replacement. Then, two location prediction methods are proposed and performed alternately in adjacent rounds of cell replacement. The first method predicts the cell locations sequentially based on the current routing results, while the second one adopts a gradient-descent-based method to predict the cell locations simultaneously from a more global perspective. Finally, we present an A*-based partial rerouting to generate the new routing results, followed by a simulated-annealing-based acceptance strategy to judge whether to accept the new routing results. Compared with the champion of the ICCAD 2020 contest and the state-of-the-art works, experimental results show that our algorithm is effective and efficient.