论文部分内容阅读
针对阵列优化问题提出了一种反复“压缩”和“放松”的算法ＳＱＵＥＥＺＥＲ。此算法在每一“压缩”和“放松”过程中，首先使用“贪婪的”（ｇｒｅｅｄｙ）方法来压缩布图面积，直到面积不再减小，再对被压缩在一起的单元进行“放松”，允许布图面积适当增大，使布图的拓扑结构得以改变，然后对放松的布图再进行“压缩”和“放松”。算法对给定的初始布图反复地“压缩”和“放松”，直到满足终止条件（如几次选代过后布图面积不再减小等）为止。测试实验结果表明，本算法和“模拟退火”算法一样，具有绕开局部最优的能力，且运算速度较快。实验结果令人满意。
Aiming at the problem of array optimization, this paper proposes an algorithm SQUEEZER which repeatedly “compresses” and “relaxes”. This algorithm first uses the “greedy” method to compress the layout area during each “compression” and “relaxation” process until the area is no longer reduced and then “relaxes” the cells that were compressed together , Allowing the layout area appropriately increased, so that the topography of the layout can be changed, and then relax the layout of the “compression” and “relaxation.” The algorithm repeatedly “compresses” and “relaxes” the given initial layout until it meets the termination condition (eg, the layout area no longer decreases after several generations of substitution). The experimental results show that this algorithm, like the “simulated annealing” algorithm, has the advantage of bypassing the local optimum and has a fast computation speed. The experimental results are satisfactory.