View in EDS

种基于共轭次梯度算法的非光滑布图规划方法.

Saved in:
Bibliographic Details
Title: 种基于共轭次梯度算法的非光滑布图规划方法.
Alternate Title: Non-smooth floorplanning method based on conjugate sub-gradient algorithm.
Authors: 孙健1 ychen@whut.edu.cn, 徐宁2, 吴建2, 朱展洋2, 陈彧1, 胡建国3
Source: Application Research of Computers / Jisuanji Yingyong Yanjiu. Sep2024, Vol. 41 Issue 9, p2751-2757. 7p.
Subject Terms: *GOLDEN ratio, *TIME complexity, *COMBINATORIAL optimization, *TIMING circuits, *NONSMOOTH optimization
Abstract (English): Aiming at the floorplanning problem with only hard modules, it is usually constructed as a combinatorial optimization model, but the time cost of solving process is high. In order to improve the solving efficiency, this paper proposed a floorplanning algorithm based on non-smooth analytic mathematical programming. Based on the coordinate representation of modules, this paper established a non-smooth mathematical programming model, which was a generalization of the optimization models corresponding to various optimization stages of different cases that were solved by the conjugate sub-gradient algorithm (CSA). Aiming at the fixed-outline floorplanning problem, this paper achieved wirelength optimization under fixed-outline constraint through the general framework consisted of three stages: global floorplanning, legalization and local optimization. To address the case without fixed-outline constraint, this paper proposed a conjugate sub-gradient algorithm with golden section strategy (CSA_GSS). The algorithm adopted golden section strategy to reduce the area of the fixed-outline and to achieve the dual effect of both area and wirelength optimization. Compared with floorplanning algorithm based on B-tree on GSRC test circuit, the proposed algorithm had advantages in terms of wirelength and time for large-scale circuits. Experimental results show that the algorithm can obtain better wirelength with lower time complexity. [ABSTRACT FROM AUTHOR]
Abstract (Chinese): 针对只有硬模块的布图规划问题,通常将其构建成组合优化模型,但求解过程时间成本高。为提高求 解效率,提出了种基于非光滑解析数学规划的布图规划算法。基于布图中器件的坐标表示,构建了个泛化 的非光滑解析数学规划模型,将不同场景下的布图规划问题的不同优化阶段处理为该泛化模型的特例,并利用 共轭次梯度算法(conjugate sub-gradient algorithm, CSA)对其进行求解。针对固定轮廓布图规划问题,通过统一框 架下的全局布图规划、合法化、局部优化三个阶段,实现了在固定轮廓约束下的线长优化。针对无固定轮廓约束 问题,提出了带黄金分割策略的共轭次梯度算法(conjugate sub-gradient algorithm with golden section strategy, CSA_ GSS),利用黄金分割策略缩小固定轮廓的面积,达到面积和线长双优化的效果。实验在GSRC测试电路上与基 于B*-树表示的布图规划算法进行比较,该算法对于大规模电路在线长和时间方面均占据优势。实验结果表 明,该算法能以更低的时间复杂度获得更优的线长。 [ABSTRACT FROM AUTHOR]
Database: Academic Search Index
Description
Abstract:Aiming at the floorplanning problem with only hard modules, it is usually constructed as a combinatorial optimization model, but the time cost of solving process is high. In order to improve the solving efficiency, this paper proposed a floorplanning algorithm based on non-smooth analytic mathematical programming. Based on the coordinate representation of modules, this paper established a non-smooth mathematical programming model, which was a generalization of the optimization models corresponding to various optimization stages of different cases that were solved by the conjugate sub-gradient algorithm (CSA). Aiming at the fixed-outline floorplanning problem, this paper achieved wirelength optimization under fixed-outline constraint through the general framework consisted of three stages: global floorplanning, legalization and local optimization. To address the case without fixed-outline constraint, this paper proposed a conjugate sub-gradient algorithm with golden section strategy (CSA_GSS). The algorithm adopted golden section strategy to reduce the area of the fixed-outline and to achieve the dual effect of both area and wirelength optimization. Compared with floorplanning algorithm based on B-tree on GSRC test circuit, the proposed algorithm had advantages in terms of wirelength and time for large-scale circuits. Experimental results show that the algorithm can obtain better wirelength with lower time complexity. [ABSTRACT FROM AUTHOR]
ISSN:10013695
DOI:10.19734/j.issn.1001-3695.2023.12.0628