Random sequence generation by cellular automata
Advances in Applied Mathematics
Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
Introduction to algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
HGA: a hardware-based genetic algorithm
FPGA '95 Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
An introduction to genetic algorithms
An introduction to genetic algorithms
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Principles of digital design
The GRD Chip: Genetic Reconfiguration of DSPs for Neural Network Processing
IEEE Transactions on Computers
Intelligence through simulated evolution: forty years of evolutionary programming
Intelligence through simulated evolution: forty years of evolutionary programming
Practical genetic algorithms
Attacking the semantic gap between application programming languages and configurable hardware
FPGA '01 Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Parallel Genetic Algorithms Population Genetics and Combinatorial Optimization
Proceedings of the 3rd International Conference on Genetic Algorithms
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
When Will a Genetic Algorithm Outperform Hill Climbing?
Proceedings of the 5th International Conference on Genetic Algorithms
Genetic Algorithm for 3D Protein Folding Simulations
Proceedings of the 5th International Conference on Genetic Algorithms
A Hardware Genetic Algorithm for the Travelling Salesman Problem on SPLASH 2
FPL '95 Proceedings of the 5th International Workshop on Field-Programmable Logic and Applications
Prototyping a GA Pipeline for Complete Hardware Evolution
EH '99 Proceedings of the 1st NASA/DOD workshop on Evolvable Hardware
An Evolvable Hardware Chip for Prosthetic Hand Controller
MICRONEURO '99 Proceedings of the 7th International Conference on Microelectronics for Neural, Fuzzy and Bio-Inspired Systems
Implementing a genetic algorithm on a parallel custom computing machine
FCCM '95 Proceedings of the IEEE Symposium on FPGA's for Custom Computing Machines
Evolvable hardware for generalized neural networks
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
FPGA implementation of neighborhood-of-four cellular automata random number generators
FPGA '02 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays
A Hardware Implementation of a Genetic Programming System Using FPGAs and Handel-C
Genetic Programming and Evolvable Machines
A Pipelined Hardware Implementation of Genetic Programming Using FPGAs and Handel-C
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
The Fast Evaluation Strategy for Evolvable Hardware
Genetic Programming and Evolvable Machines
Development of a customized processor architecture for accelerating genetic algorithms
Microprocessors & Microsystems
On Evolutionary Synthesis of Linear Transforms in FPGA
ICES '08 Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware
FPGA Implementation of Genetic Algorithm for UAV Real-Time Path Planning
Journal of Intelligent and Robotic Systems
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Speeding up hardware evolution: a coprocessor for evolutionary algorithms
ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware
Using systolic technique to accelerate an EHW engine for lossless image compression
ICES'07 Proceedings of the 7th international conference on Evolvable systems: from biology to hardware
Hardware accelerators for Cartesian genetic programming
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Customizable FPGA IP core implementation of a general-purpose genetic algorithm engine
IEEE Transactions on Evolutionary Computation
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
A flexible on-chip evolution system implemented on a xilinx Virtex-II pro device
ICES'05 Proceedings of the 6th international conference on Evolvable Systems: from Biology to Hardware
Hi-index | 0.00 |
Accelerating a genetic algorithm (GA) by implementing it in a reconfigurable field programmable gate array (FPGA) is described. The implemented GA features: random parent selection, which conserves selection circuitry; a steady-state memory model, which conserves chip area; survival of fitter child chromosomes over their less-fit parent chromosomes, which promotes evolution. A net child chromosome generation rate of one per clock cycle is obtained by pipelining the parent selection, crossover, mutation, and fitness evaluation functions. Complex fitness functions can be further pipelined to maintain a high-speed clock cycle. Fitness functions with a pipeline initiation interval of greater than one can be plurally implemented to maintain a net evaluated-chromosome throughput of one per clock cycle. Two prototypes are described: The first prototype (c. 1996 technology) is a multiple-FPGA chip implementation, running at a 1 MHz clock rate, that solves a 94-row × 520-column set covering problem 2,200× faster than a 100 MHz workstation running the same algorithm in C. The second prototype (Xilinx XVC300) is a single-FPGA chip implementation, running at a 66 MHZ clock rate, that solves a 36-residue protein folding problem in a 2-d lattice 320× faster than a 366 MHz Pentium II. The current largest FPGA (Xilinx XCV3200E) has circuitry available for the implementation of 30 fitness function units which would yield an acceleration of 9,600× for the 36-residue protein folding problem.