Discrete and continuous particle swarm optimization for FPGA placement

This paper proposes the use of a particle swarm optimization algorithm to the Field Programmable Gate Arrays (FPGA) placement problem. Two different versions of the particle swarm optimization algorithm are proposed. The first is a discrete version that solves the FPGA placement problem entirely in the discrete domain, while the second version is continuous in nature. Both versions are applied to several well-known FPGA benchmarks and the results are compared to those obtained by an academic placement tool that is based on adaptive simulated annealing. Results show that the proposed methods are competitive for small and medium-sized problems. For large-sized problems, the proposed methods provide very close results.

[1]  Andries Petrus Engelbrecht,et al.  Determining RNA Secondary Structure using Set-based Particle Swarm Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[2]  Bin Jiao,et al.  A Dual Similar Particle Swarm Optimization Algorithm for Job-Shop Scheduling with Penalty , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[3]  Ganesh K. Venayagamoorthy,et al.  Swarm intelligence for digital circuits implementation on field programmable gate arrays platforms , 2004, Proceedings. 2004 NASA/DoD Conference on Evolvable Hardware, 2004..

[4]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[5]  Jigui Sun,et al.  An Improved Discrete Particle Swarm Optimization Algorithm for TSP , 2007, 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops.

[6]  Mehmet Fatih Tasgetiren,et al.  A Discrete Particle Swarm Optimization Algorithm for Single Machine Total Earliness and Tardiness Problem with a Common Due Date , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[7]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[8]  Yunlong Zhu,et al.  Solving Weapon-Target Assignment Problem using Discrete Particle Swarm Optimization , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[9]  Vaughn Betz,et al.  Architecture and CAD for Deep-Submicron FPGAS , 1999, The Springer International Series in Engineering and Computer Science.

[10]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[11]  Jun Feng,et al.  Improved particle swarm optimization algorithm for optimum steelmaking charge plan based on the pseudo TSP solution , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[12]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).