A path-based timing-driven quadratic placement algorithm

This paper presents a path-based timing-driven quadratic placement algorithm. The delay of the path acts as the timing constraints. In the global optimization step, it tries to satisfy the timing constraints. In the partition step, it tries to decrease the cut number of critical paths. It has some special skills, such as decreasing the delay on the longest path, and pad assignment, to decrease the delay further. Results show this algorithm can improve the timing behavior more than 20%.