Ant Colony Based Approach for Solving FPGA routing

This paper is based on an ant colony optimization algorithm (ASDR) for solving FPGA routing for a route based routing constraint model in FPGA design architecture. I n this approach FPGA routing task is transformed into a Boolean Satisfiabilty (SAT) equation with the property that any assignment of input variables that satisfies the equation specifies a v alid route. The Satisfiability equation is then modeled as Constraint Satisfaction problem, which helps in reducing procedural programming. Satisfying assignment for particular route will result in a valid routing and absence of a satisfying assignment implies that the layout is unroutable. In second step ant colony optimization algorithm is applied on t he Boolean equation for solving routing alternatives utilizing approach of hard combinatorial optimization problems. The experimental results suggest that the developed ant colony optimization algorithm based router has taken extremely short CPU time as compared to classical Satisfiabilty based detailed router (SDR) and finds all possible routes even for large FPGA circuits.

[1]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[2]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[3]  Kia Bazargan,et al.  Fast timing-driven partitioning-based placement for island style FPGAs , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[4]  Christine Solnon,et al.  Ant Colony Optimization for Multi-Objective Optimization Problems , 2007, 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007).

[5]  Gang Wang,et al.  System Level Partitioning for Programmable Platforms Using the Ant Colony Optimization , 2004 .

[6]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[7]  Vaughn Betz,et al.  VPR: A new packing, placement and routing tool for FPGA research , 1997, FPL.

[8]  Amardeep Singh,et al.  Optimized FPGA Routing using Soft Computing , 2010 .

[9]  Roberto Montemanni,et al.  Ant Colony Optimisation for vehicle routing problems: from theory to applications. , 2004 .

[10]  Rob A. Rutenbar,et al.  Satisfiability-based layout revisited: detailed routing of complex FPGAs via search-based Boolean SAT , 1999, FPGA '99.

[11]  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..

[12]  M. Parashar,et al.  Ant Colony Optimization and its Application to Boolean Satisfiability for Digital VLSI Circuits , 2006, 2006 International Conference on Advanced Computing and Communications.

[13]  Gang Wang,et al.  Application partitioning on programmable platforms using the ant colony optimization , 2006, J. Embed. Comput..

[14]  Li Li,et al.  A Novel Hybrid Particle Swarm Optimization Algorithm Combined with Harmony Search for High Dimensional Optimization Problems , 2007, The 2007 International Conference on Intelligent Pervasive Computing (IPC 2007).

[15]  Frank Neumann,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .

[16]  Kia Bazargan,et al.  Timing-driven partitioning-based placement for island style FPGAs , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Armin Biere,et al.  Decomposing SAT Problems into Connected Components , 2006, J. Satisf. Boolean Model. Comput..

[18]  Rob A. Rutenbar,et al.  Satisfiability-based detailed FPGA routing , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[19]  Thomas Stützle,et al.  A SHORT CONVERGENCE PROOF FOR A CLASS OF ACO ALGORITHMS , 2002 .

[20]  Eliezer L. Lozinskii.  Impurity: Another Phase Transition of SAT , 2006, J. Satisf. Boolean Model. Comput..

[21]  Rob A. Rutenbar,et al.  FPGA routing and routability estimation via Boolean satisfiability , 1997, FPGA '97.

[22]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[23]  Martine D. F. Schlag,et al.  On Routability Prediction for Field-Programmable Gate Arrays , 1993, 30th ACM/IEEE Design Automation Conference.

[24]  Roberto Montemanni,et al.  Ant colony optimization for real-world vehicle routing problems , 2007, Swarm Intelligence.

[25]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[26]  Rob A. Rutenbar,et al.  A comparative study of two Boolean formulations of FPGA detailed routing constraints , 2001, IEEE Transactions on Computers.

[27]  Elena Marchiori,et al.  Evolutionary Algorithms for the Satisfiability Problem , 2002, Evolutionary Computation.