Artificial bee colony for the standard cell placement problem
by Najwa Altwaijry; Mohamed El Bachir Menai
International Journal of Metaheuristics (IJMHEUR), Vol. 2, No. 3, 2013

Abstract: Placement is an important step in the VLSI design process, of which standard cell placement (SCP) is a well-studied problem. The four 'pure' major algorithms for placement include simulated annealing, quadratic placement, min-cut placement, and force-directed placement. The four pure algorithms are inadequate for today's complex problems; hybrid methods are better able to solve the current SCP problem sizes. The objective of this paper is to present a swarm intelligence-based method for SCP. The method used to solve the SCP problem is the artificial bee colony (ABC) algorithm, in conjunction with hMetis, a partitioning package. Our artificial bee colony PLacer tool (abcPL), has been tested on the PEKU benchmark suite. Results obtained show that ABC is a promising approach for solving the SCP problem.

Online publication date: Sat, 05-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com