PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Baraglia R., Hidalgo J. I., Lanchares J., Perego R., Tirado F. A Parallel Compact Genetic Algorithm for multi-FPGA Partitioning. In: Euromicro Workshop on Parallel and Distributed Processing (Mantova, 2001). Proceedings, IEEE, 2001.
 
 
Abstract
(English)
In this paper we investigate the design of a compact genetic algorithm to solve Multi-FPGA Partitioning problems. Nowadays Multi-FPGA systems are used for a great variety of applications such as dynamically re-configurable hardware applications, digital circuit emulation, and numerical computation. Both a sequential and a parallel version of a compact genetic algorithm (cGA) have been designed and implemented on a cluster of workstations. The peculiarities of the cGA permits to save memory in order to address large Multi-FPGA Parfitioning problems, while the exploitation of parallelism allows to reduce execution times. The good results achieved on several experiments conduced on different Multi-FPGA Partitioning instances show that this solution is viable to solve Multi-FPGA Partitioning problems.
Subject Multi-FPGA
Parallel algorithms
C.1 PROCESSOR ARCHITECTURES


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional