A path-based timing-driven quadratic placement algorithm

Author

Hou, Wenting ; Hong, Xianlong ; Wu, Weimin ; Cai, Yici

Author_Institution

Dept. Comput. Sci. & Technol., Tsinghua Univ., Beijing, China

fYear

2003

fDate

21-24 Jan. 2003

Firstpage

745

Lastpage

748

Abstract

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%.

Keywords

circuit optimisation; integrated circuit layout; quadratic programming; timing; critical path number reduction; global optimization; longest path delay reduction; pad assignment; partition step; path delay; path-based placement algorithm; quadratic placement; timing constraints; timing-driven placement; Computer science; Constraint optimization; Delay; Integrated circuit interconnections; Partitioning algorithms; Quadratic programming; Routing; Timing; Very large scale integration; Wire;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation Conference, 2003. Proceedings of the ASP-DAC 2003. Asia and South Pacific

Print_ISBN

0-7803-7659-5

Type

conf

DOI

10.1109/ASPDAC.2003.1195119

Filename

1195119

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3400841