Research Article Open Access

AN EFFICIENT CELL PLACEMENT USING GRAVITATIONAL SEARCH ALGORITHMS

Rose Al Qasem1 and Taisir Eldos2
  • 1 Al Balqa Applied University, Jordan
  • 2 Salman Bin Abdulaziz University, Saudi Arabia

Abstract

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.

Journal of Computer Science
Volume 9 No. 8, 2013, 943-948

DOI: https://doi.org/10.3844/jcssp.2013.943.948

Submitted On: 1 June 2013 Published On: 25 June 2013

How to Cite: Qasem, R. A. & Eldos, T. (2013). AN EFFICIENT CELL PLACEMENT USING GRAVITATIONAL SEARCH ALGORITHMS. Journal of Computer Science, 9(8), 943-948. https://doi.org/10.3844/jcssp.2013.943.948

  • 2,981 Views
  • 3,309 Downloads
  • 7 Citations

Download

Keywords

  • Cell Placement
  • VLSI Circuit
  • Optimization Algorithms
  • Gravitational Search