Research Article
Article:Optimized FPGA Routing using Soft Computing
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 7 - Issue 8 |
| Published: October 2010 |
| Authors: Saveena, Vinay Chopra, Dr. Amardeep Singh |
10.5120/1273-1791
|
Saveena, Vinay Chopra, Dr. Amardeep Singh . Article:Optimized FPGA Routing using Soft Computing. International Journal of Computer Applications. 7, 8 (October 2010), 8-13. DOI=10.5120/1273-1791
@article{ 10.5120/1273-1791,
author = { Saveena,Vinay Chopra,Dr. Amardeep Singh },
title = { Article:Optimized FPGA Routing using Soft Computing },
journal = { International Journal of Computer Applications },
year = { 2010 },
volume = { 7 },
number = { 8 },
pages = { 8-13 },
doi = { 10.5120/1273-1791 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2010
%A Saveena
%A Vinay Chopra
%A Dr. Amardeep Singh
%T Article:Optimized FPGA Routing using Soft Computing%T
%J International Journal of Computer Applications
%V 7
%N 8
%P 8-13
%R 10.5120/1273-1791
%I Foundation of Computer Science (FCS), NY, USA
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.
References
- S. Bade, B. Hutchings, “Fpga based stochastic neural network implementation, in: Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines”, 1994, pp. 189–198.
- M. Dorigo, G. Di Caro, L.M. Gambardella, “Ant algorithms for discrete optimization, Artificial Life” 5 (2) 1999 137–172.
- E.-G. Talbi, O. Roux, C. Fonlupt, D. Robillard, “Parallel ant colonies for combinatorial optimization problems”, in: J.R. et al. (Eds.), Parallel and Distributed Processing, 11 IPPS/SPDP’99 Workshops, no. 1586 in LNCS, Springer-Verlag, 1999, pp. 239–247.
- Stützle, T. and H. H. Hoos, MAX-MIN ant system, Future Gener. Comput. Syst., vol. 16, no.8, pp.889-914, 2000.
- M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC’01), pages 530–535, June 2001.
- E. Goldberg and Y. Novikov, “BerkMin: A Fast and Robust SAT solver,” Proc. Design, Automation, and Test in Europe (DATE ’02, pp. 142-149, Mar. 2002.
- Stützle, T. and Dorigo M., “A Short Convergence Proof for a Class of ACO Algorithms”, IEEE Transactions on Evolutionary Computation, 6 (4), 2002 (in press).
- Niklas E´en and Niklas S¨orensson. An extensible sat solver. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing, LNCS 2919, pages 502–518, 2003.
- Neumann, F. and Witt, C., Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Electronic Colloquium on Computational Complexity (ECCC), Report No. 84.,2006.
- Eliezer L. Lozinskii, Impurity: Another phase transition of SAT, Journal on Satisfiability, Boolean Modeling and Computation, vol. 1, 2006, pp. 123-14.
- Ines Alaya, Christine Solnon, Khaled Ghedira. “Ant Colony Optimization for Multi-objective Optimization Problems”, ICTAI 2007 vol. 1, pp. 450-457, 2007
- Walter J. Gutjahr. “First Steps to the Runtime Complexity Analysis of Ant Colony Optimization”, Computers and Operations Research, Volume 35, Issue 9, pp. 2711-2727, 2008
- Nattapat Attiratanasunthron Jittat Fakcharoenphol, “A Running Time Analysis for an Ant Colony Optimization Algorithm for Shortest Paths on Directed Acyclic Graphs”, Information processing letters, vol 105, Issue 3, pp. 88-92, 2008.
Index Terms
Keywords