VLSI cell placement techniques
ACM Computing Surveys (CSUR)
Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Can recursive bisection alone produce routable placements?
Proceedings of the 37th Annual Design Automation Conference
Improved algorithms for hypergraph bipartitioning
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Physical hierarchy generation with routing congestion control
Proceedings of the 2002 international symposium on Physical design
Multilevel optimization for large-scale circuit placement
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Dragon2000: standard-cell placement tool for large industry circuits
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Optimality, scalability and stability study of partitioning and placement algorithms
Proceedings of the 2003 international symposium on Physical design
Congestion and timing optimization for standard-cell placement
Congestion and timing optimization for standard-cell placement
An Enhanced Multilevel Algorithm for Circuit Placement
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Capo: robust and scalable open-source min-cut floorplacer
Proceedings of the 2005 international symposium on Physical design
On the performance of artificial bee colony (ABC) algorithm
Applied Soft Computing
Journal of Global Optimization
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
A swarm intelligence approach to the quadratic minimum spanning tree problem
Information Sciences: an International Journal
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
Information Sciences: an International Journal
Artificial bee colony algorithm for the capacitated vehicle routing problem
ECC'11 Proceedings of the 5th European conference on European computing conference
Multilevel global placement with congestion control
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimality and scalability study of existing placement algorithms
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Routability-Driven Placement and White Space Allocation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Artificial bee colony programming for symbolic regression
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.