AN EFFICIENT CELL PLACEMENT USING GRAVITATIONAL SEARCH ALGORITHMS
Rose Al Qasem and Taisir Eldos
DOI : 10.3844/jcssp.2013.943.948
Journal of Computer Science
Volume 9, Issue 8
In modern chip design, cell placement is a stage in which cells representing well-defined functions are assigned physical locations, in a way that optimizes the total area and routing length. Cell placement is an NP-complete problem and the exact solution is generally far from reach for a practically sized instance. Hence, diversified heuristic algorithms are used to solve this problem. In this study, we adapted a recently introduced evolutionary search algorithm called Gravitational Search Algorithm (GSA) to this problem. Experiments show that the proposed algorithm delivers good performance; good solution quality and likelihood of optimality within reasonably small amount of time.
© 2013 Rose Al Qasem and Taisir Eldos. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.