用解定位问题求延时优化驱动布局

A Timing－Driven Placement Algorithm Based on Solving Allocation Problem

延时优化驱动布局是为提高ＩＣ性能最早进行研究的课题之一，但目前的算法存在运算速度慢，设计结果欠佳等缺点．本文基于解定位问题，将布局过程分为初始定位、再定位和消除重选三个阶段．实验结果表明，它不仅布局速度快，而且能减小ＩＣ延时．

Timing-driven placement is the earliest approach to improve IC performance.However,the present algorithms run slowly and the designs are dissatisfactory. This paper,based on solving allocation problem,presents a placement algorithm that consists of initial placement,replacement and deleting overlapping. The experiment result shows that our algorithm runs fast and can reduce the IC delay.