 |
    |
Multi-FPGA Systems Synthesis by Means of Evolutionary Computation
J.I. Hidalgo1, F. Fernández2, J. Lanchares1, J.M. Sánchez2, R. Hermida1, M. Tomassini3, R. Baraglia4, R. Perego4, and O. Garnica1
1Computer Architecture Department (DACYA)
Universidad Complutense de Madrid, Spain
{hidalgo,julandan,rhermida,ogarnica}@dacya.ucm.es
2Departamento de Informática
Universidad de Extremadura, Spain
{fcofdez,jmsanchez}@unex.es
3Computer Science Institute
University of Laussane, Switzerland
Marco.Tomassini@iismail.unil.ch
4Istituto di Scienza e tecnologie dell'informazione "Alessandro Faedo"
CNR, Italy
{Ranieri.Baraglia,Raffaele.Perego}@cnuce.cnr.it
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.
LNCS 2724, p. 2109 ff.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003