KFUPM ePrints

Timing Driven Genetic Algorithm for Placement

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.

[img]
Preview
PDF
757Kb

Abstract

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)
Date:March 1995
Subjects:Computer
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:sadiq@kfupm.edu.sa, youssef@kfupm.edu.sa, UNSPECIFIED, UNSPECIFIED
ID Code:131
Deposited By:AbdulRahman
Deposited On:26 Feb 2008 15:18
Last Modified:12 Apr 2011 13:07

Repository Staff Only: item control page