Timing driven genetic placement

Timing driven genetic placement. COMPUTER SYSTEMS SCIENCE AND ENGINEERING 14 (1): 3-14 JAN 1999.


Download (6MB) | Preview


IN this paper we present a timing driven placer for standard cell IC design. The placement algorithm follows the genetic paradigm, with the objective of minimizing both area and path slacks. At early generations, the search is biased toward solutions with superior timing characteristics. As the algorithm starts converging towards generations with acceptable delay properties, the objective is dynamically adjusted toward optimizing area and routability. Experiments with benchmark test demonstrate delay performance improvement by up to 20%. It is also shown that sizeable reduction in runtime is obtained when population size is allowed to decrease in a controlled manner whenever the search his a plateau. This reduction in runtime is achieved without any noticeable loss in solution quality.

Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: AbdulRahman
Date Deposited: 11 Mar 2008 12:29
Last Modified: 01 Nov 2019 13:23
URI: https://eprints.kfupm.edu.sa/id/eprint/323