Sait, Sadiq M. and Youssef, H. and Nassar, K. and Benten, M. S. (1995) Timing Driven Genetic Algorithm for Placement. In: IEEE Phoenix Conference on Computers and Communications, IPCCC.
In this paper we present a timing -driven placer for standard-cell IC design. The placement algorithm follows the genetic pradigm. At early generations, the search is biased towards solutions with superior timing characteristics. As the algorithm starts converging towards generations with acceptable delay properties, the objective is dynamically adjusted towards optimizing area and routability. Experiments with test circuits demonstrate delay performance improvement by upto 20%. Without any noticeable loss in solution quality, sizebale reduction in runtime is obtained when population size is allowed to decrease in a controlled manner whenever the search hits a plateau.
|Item Type:||Conference or Workshop Item (Other)|
|Divisions:||College Of Computer Sciences and Engineering > Computer Engineering Dept|
|Creators:||Sait, Sadiq M. and Youssef, H. and Nassar, K. and Benten, M. S.|
|Email:||firstname.lastname@example.org, email@example.com, UNSPECIFIED, UNSPECIFIED|
|Deposited On:||26 Feb 2008 15:18|
|Last Modified:||12 Apr 2011 13:07|
Repository Staff Only: item control page