Genetic Algorithm for Boolean minimization in an FPGA cluster

  • Authors:
  • César Pedraza;Javier Castillo;José I. Martínez;Pablo Huerta;Jose L. Bosque;Javier Cano

  • Affiliations:
  • DATCCCIA, ETSII, Universidad Rey Juan Carlos, Madrid, Spain;DATCCCIA, ETSII, Universidad Rey Juan Carlos, Madrid, Spain;DATCCCIA, ETSII, Universidad Rey Juan Carlos, Madrid, Spain;DATCCCIA, ETSII, Universidad Rey Juan Carlos, Madrid, Spain;Facultad de Ciencias, Dpto. de Electrónica y Computadores, Universidad de Cantabria, Santander, Spain;DATCCCIA, ETSII, Universidad Rey Juan Carlos, Madrid, Spain

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Evolutionary algorithms are an alternative option to the Boolean synthesis due to that they allow one to create hardware structures that would not be able to be obtained with other techniques. This paper shows a parallel genetic programming (PGP) Boolean synthesis implementation based on a cluster of FPGAs that takes full advantage of parallel programming and hardware/software co-design techniques. The performance of our cluster of FPGAs implementation has been compared with an HPC implementation. The experimental results have shown an excellent behavior in terms of speed up (up to 脳500) and in terms of solving the scalability problems of this algorithms present in previous works.