论文部分内容阅读
快速地在局部范围内调整布图已经成为一种设计需要。该文提出了一种二阶段法来实现边界约束下的增量式布图规划算法。根据已有布图规划建立松弛推移图,直观描述各模块之间“空白区”和松弛量的情况;同时建立模块交换图,记录所有具有形状相似特征的模块集合,基于这2个图进行增量式布图规划。第1阶段,基于推移图和交换图调整布图规划,使其满足边界约束。第2阶段,再次利用交换图进行互连性能优化。实验结果表明该算法在较短的时间里不仅对原有布图规划进行了有效调整满足了给定的所有的几何约束,而且还保证了芯片的面积和线长效果。
Quickly adjusting layouts locally has become a design need. This paper proposes a two-stage method to realize the incremental layout planning algorithm with boundary constraints. According to the existing plan, a relaxation map is established to describe the “white space” and the amount of slack between the modules visually. At the same time, a module exchange diagram is established to record all modules with similar shape and shape. Based on the two maps Make an incremental layout plan. In the first stage, layout planning is adjusted based on the transition diagram and the exchange diagram so as to satisfy the boundary constraint. In phase 2, the exchange graph is again used to optimize interconnect performance. The experimental results show that the proposed algorithm not only effectively adjusts the original layout in a short period of time, but also ensures the chip area and line length.