Abstract
Multi-FPGA systems (MFS) are used for a great variety of applications, for instance, dynamically re-configurable hardware applications, digital circuit emulation, and numerical computation. There are a great variety of boards for MFS implementation. In this paper a methodology for MFS design is presented. The techniques used are evolutionary programs and they solve all of the design tasks (partitioning placement and routing). Firstly a hybrid compact genetic algorithm solves the partitioning problem and then genetic programming is used to obtain a solution for the two other tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Trimberger. “Field Programmable Gate Array Technology”. Kluwer 1994.
S. Hauck,: Multi-FPGA systems. Ph. D. dissertation. University of Washington. 1994
M. Baxter. “Icarus: A dinamically reconfigurable computer architecture” IEEE Symposium on FPGAs for Custom Computing machines, 1999, 278–279.
R. Macketanz, W. Karl. “JVX: a rapid prototyping system based on Java and FPGAs”. In Field Programmable Logic: From FPGAs to Computing Paradigm, pages 99–108. Spinger Verlag, 1998
M.I. Heywood and A.N. Zincir-Heywood. “Register based genetic programming on FPGA computing platforms”. Euro GP 2000, 44–59.
CAD Benmarching Laboratory, http://vlsicad.cs.ud.edu/
XNF: Xilinx Netlist Format”, http://www.xilinx.com
F. Harary. “Graph Theory”. Addison-Wesley 1968
J.I. Hidalgo, J. Lanchares, R. Hermida. “Graph Partitioning methods for Multi-FPGA systems and Reconfigurable Hardware based on Genetic algorithms”, Proceedings of the 1999 Genetic and Evolutionary Computation Conference Workshop Program, Orlando (USA), 1999, 357–358.
G.R. Harik, F.G. Lobo, D. E. Goldberg “The Compact Genetic Algorithm”. Illigal Report No 97006, August 1997. University of Illinois at Urbana-Champaign
G.R. Harik, F.G. Lobo, D. E. Goldberg “The Compact Genetic Algorithm”. IEEE Transactions on Evolutionary Computation. Vol. 3, No. 4, pp. 287–297, 1999.
J.I. Hidalgo. R. Baraglia, R. Perego, J. Lanchares, F. Tirado. “A Parallel compact genetic algorithm for Multi-FPGA partitioning” Euromicro PDP 2001, 113–120. IEEE Press.
R, Baraglia, J.I. Hidalgo, and R. Perego. “A Hybrid Heuristic for the Travelling Salesman Problem”. IEEE Transactions on Evolutionary Computation. Vol. 5, No. 6, pp. 613–622, December 2001.
J.R. Koza: Genetic Programming. On the programming of computers by mens of natural selection. Cambridge MA: The MIT Press
F. Fernández, J.M. Sánchez, M. Tomassini, “Placing and routing circuits on FPGAs by means of Parallel and Distributed Genetic Programming”. Proceedings 4th international conference on Evolvable systems ICES 2001.
M. Tomassini, F. Fernández, L. Vannexhi, L. Bucher, “An MPI-Based Tool for Distributed Genetic Programming” In Proceedings of IEEE International Conference on Cluster Computing CLUSTER2000, IEEE Computer Society. Pp. 209–216
J.I. Hidalgo, J. Lanchares, A. ibarra, R. Hermida. A Hybrid Evolutionary Algorithm for Multi-FPGA Systems Design. Proceedings of Euromicro Symposium on Digital System Design, DSD 2002. Dortmund, Germany, September 2002. IEEE Press, pp. 60–68.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hidalgo, J.I. et al. (2003). Multi-FPGA Systems Synthesis by Means of Evolutionary Computation. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_107
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive