Artificial bee colony for the standard cell placement problem

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.

[1]  Dervis Karaboga,et al.  A comprehensive survey: artificial bee colony (ABC) algorithm and applications , 2012, Artificial Intelligence Review.

[2]  Jason Cong,et al.  Routability-driven placement and white space allocation , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[3]  W. Y. Szeto,et al.  An artificial bee colony algorithm for the capacitated vehicle routing problem , 2011, Eur. J. Oper. Res..

[4]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.

[5]  Majid Sarrafzadeh,et al.  Congestion Minimization in Modern Placement Circuits , 2007, Modern Circuit Placement.

[6]  Jarrod A. Roy,et al.  Capo: Congestion-Driven Placement for Standard-cell and RTL Netlists with Incremental Capability , 2007, Modern Circuit Placement.

[7]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[8]  Majid Sarrafzadeh,et al.  Congestion and timing optimization for standard-cell placement , 2002 .

[9]  Joseph R. Shinnerl,et al.  An Enhanced Multilevel Algorithm for Circuit Placement , 2003, ICCAD 2003.

[10]  Jason Cong,et al.  Optimality, scalability and stability study of partitioning and placement algorithms , 2003, ISPD '03.

[11]  Dervis Karaboga,et al.  Artificial bee colony algorithm , 2010, Scholarpedia.

[12]  Jarrod A. Roy,et al.  Capo: robust and scalable open-source min-cut floorplacer , 2005, ISPD '05.

[13]  Dervis Karaboga,et al.  Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems , 2007, IFSA.

[14]  Ivona Brajevic,et al.  Artificial bee colony algorithm for the capacitated vehicle routing problem , 2011 .

[15]  Jason Cong,et al.  Multilevel global placement with congestion control , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  G. Karypis,et al.  Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Jason Cong,et al.  Physical hierarchy generation with routing congestion control , 2002, ISPD '02.

[18]  Dervis Karaboga,et al.  Artificial bee colony programming for symbolic regression , 2012, Inf. Sci..

[19]  Majid Sarrafzadeh,et al.  A snap-on placement tool , 2000, ISPD '00.

[20]  André Rossi,et al.  An Artificial Bee Colony Algorithm for the 0-1 Multidimensional Knapsack Problem , 2010, IC3.

[21]  Quan-Ke Pan,et al.  Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems , 2011 .

[22]  Andrew B. Kahng,et al.  Improved algorithms for hypergraph bipartitioning , 2000, ASP-DAC '00.

[23]  Rui Zhang,et al.  An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times , 2011, Entropy.

[24]  Dervis Karaboga,et al.  A combinatorial Artificial Bee Colony algorithm for traveling salesman problem , 2011, 2011 International Symposium on Innovations in Intelligent Systems and Applications.

[25]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[26]  Xiujuan Lei,et al.  Artificial bee colony algorithm for solving multiple sequence alignment , 2010, 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA).

[27]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[28]  Majid Sarrafzadeh,et al.  Dragon2000: standard-cell placement tool for large industry circuits , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[29]  Jason Cong,et al.  Optimality and scalability study of existing placement algorithms , 2004, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[30]  Andrew B. Kahng,et al.  Can recursive bisection alone produce routable, placements? , 2000, Proceedings 37th Design Automation Conference.

[31]  Majid Sarrafzadeh,et al.  New Methodologies for Congestion Estimation and Reduction , 2008 .

[32]  Pinaki Mazumder,et al.  VLSI cell placement techniques , 1991, CSUR.

[33]  Alok Singh,et al.  A swarm intelligence approach to the quadratic minimum spanning tree problem , 2010, Inf. Sci..

[34]  Joseph R. Shinnerl,et al.  Multilevel optimization for large-scale circuit placement , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).