Optimized FPGA Routing using Soft Computing
TL;DR: This work has shown that Ant Colony Optimizations can also be implemented on FPGAs, leading to significant speedups in runtime compared to implementations in software on sequential machines.
read more
Abstract: FPGAs are used for a wide range of applications, e.g. network communication, video communication and processing and cryptographic applications. It has been shown that FPGAs are suitable for the implementation of soft computing techniques like Neural Networks and Genetic Algorithms. In this work we have shown that Ant Colony Optimizations can also be implemented on FPGAs, leading to significant speedups in runtime compared to implementations in software on sequential machines. This paper presents an ant colony optimization algorithm for geometric FPGA routing for a route based routing constraint model in FPGA design architecture.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Ant Colony Optimization approach for Solving FPGA routing with minimum Channel Width
Vinay Chopra,Cse Deptt,Punjab India,Amardeep Singh,Patiala Punjab India +4 more
- 01 Jan 2011
TL;DR: The experimental results suggested that the developed ant colony optimization algorithm is taking fewer amounts of time and minimum channel width to route a FPGA chip.
5
Solving FPGA Routing using Ant Colony Optimization with Minimum CPU Time
Vinay Chopra,Amardeep Singh +1 more
- 01 Jan 2011
TL;DR: The experimental results suggest that the developed ant colony optimization algorithm has taken less CPU time as compared to zChaff and GRASP to route a FPGA circuit.
Ant Colony Based Approach for Solving FPGA routing
Vinay Chopra,Amardeep Singh +1 more
- 01 Jan 2011
TL;DR: 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.
•Journal Article
Review of Efficient and Innovative Mathematical Models on VLSI Circuit Partitioning
TL;DR: This work presents here chronological order of different procedures based on variety of graph theoretical and optimization techniques that fall into major classification of deterministic and Probabilistic tool kits.
References
Chaff: engineering an efficient SAT solver
Matthew W. Moskewicz,Conor F. Madigan,Ying Zhao,Lintao Zhang,Sharad Malik +4 more
- 22 Jun 2001
TL;DR: The development of a new complete solver, Chaff, is described which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy.
An Extensible SAT-solver
Niklas Een,Niklas Sörensson +1 more
- 05 May 2003
TL;DR: This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.
Ant algorithms for discrete optimization
TL;DR: An overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and the ant colony optimization (ACO) metaheuristic is presented.
3K
MAX-MIN Ant system
Thomas Stützle,Holger H. Hoos +1 more
TL;DR: Computational results on the Traveling Salesman Problem and the Quadratic Assignment Problem show that MM AS is currently among the best performing algorithms for these problems.
2.9K
Granule Based Intertransaction Association Rule Mining
Wanzhong Yang,Yuefeng Li,Yue Xu +2 more
- 29 Oct 2007
TL;DR: This work proposes an alternative approach of granule based intertransaction association rule mining, where a granule is a group of transactions that meet a certain constraint, and shows that this approach is promising in real-world industry.