HGA: a hardware-based genetic algorithm

Stephen D. Scott, Ashok Samal, Sharad Seth

Research output: Contribution to conferencePaper

107 Citations (Scopus)

Abstract

A genetic algorithm (GA) is a robust problem-solving method based on natural selection. Hardware's speed advantage and its ability to parallelize offer great rewards to genetic algorithms Speedups of 1-3 orders of magnitude have been observed when frequently used software routines were implemented in hardware by way of reprogrammable field-programmable gate arrays (FPGAs). Reprogrammability is essential in a general-purpose GA engine because certain GA modules require changeability (e.g. the function to be optimized by the GA). Thus a hardware-based GA is both feasible and desirable. A fully functional hardware-based genetic algorithm (the HGA) is presented here as a proof-of-concept system. It was designed using VHDL to allow for easy scalability. It is designed to act as a coprocessor with the CPU of a PC. The user programs the FPGAs which implement the function to be optimized. Other GA parameters may also be specified by the user. Simulation results and performance analyses of the HGA are presented. A prototype HGA is described and compared to a similar GA implemented in software. In the simple tests, the prototype took about 6% as many clock cycles to run as the software-based GA. Further suggested improvements could realistically make the HGA 2-3 orders of magnitude faster than the software-based GA.

Original languageEnglish (US)
Pages53-59
Number of pages7
StatePublished - Jan 1 1995
EventProceedings of the 1995 ACM 3rd International Symposium on Field-Programmable Gate Arrays - Monterey, CA, USA
Duration: Feb 12 1995Feb 14 1995

Other

OtherProceedings of the 1995 ACM 3rd International Symposium on Field-Programmable Gate Arrays
CityMonterey, CA, USA
Period2/12/952/14/95

Fingerprint

Genetic algorithms
Hardware
Field programmable gate arrays (FPGA)
Computer hardware description languages
Program processors
Scalability
Clocks
Engines

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Scott, S. D., Samal, A., & Seth, S. (1995). HGA: a hardware-based genetic algorithm. 53-59. Paper presented at Proceedings of the 1995 ACM 3rd International Symposium on Field-Programmable Gate Arrays, Monterey, CA, USA, .

HGA : a hardware-based genetic algorithm. / Scott, Stephen D.; Samal, Ashok; Seth, Sharad.

1995. 53-59 Paper presented at Proceedings of the 1995 ACM 3rd International Symposium on Field-Programmable Gate Arrays, Monterey, CA, USA, .

Research output: Contribution to conferencePaper

Scott, SD, Samal, A & Seth, S 1995, 'HGA: a hardware-based genetic algorithm' Paper presented at Proceedings of the 1995 ACM 3rd International Symposium on Field-Programmable Gate Arrays, Monterey, CA, USA, 2/12/95 - 2/14/95, pp. 53-59.
Scott SD, Samal A, Seth S. HGA: a hardware-based genetic algorithm. 1995. Paper presented at Proceedings of the 1995 ACM 3rd International Symposium on Field-Programmable Gate Arrays, Monterey, CA, USA, .
Scott, Stephen D. ; Samal, Ashok ; Seth, Sharad. / HGA : a hardware-based genetic algorithm. Paper presented at Proceedings of the 1995 ACM 3rd International Symposium on Field-Programmable Gate Arrays, Monterey, CA, USA, .7 p.
@conference{f63742a7569347e9b1cee091b0739328,
title = "HGA: a hardware-based genetic algorithm",
abstract = "A genetic algorithm (GA) is a robust problem-solving method based on natural selection. Hardware's speed advantage and its ability to parallelize offer great rewards to genetic algorithms Speedups of 1-3 orders of magnitude have been observed when frequently used software routines were implemented in hardware by way of reprogrammable field-programmable gate arrays (FPGAs). Reprogrammability is essential in a general-purpose GA engine because certain GA modules require changeability (e.g. the function to be optimized by the GA). Thus a hardware-based GA is both feasible and desirable. A fully functional hardware-based genetic algorithm (the HGA) is presented here as a proof-of-concept system. It was designed using VHDL to allow for easy scalability. It is designed to act as a coprocessor with the CPU of a PC. The user programs the FPGAs which implement the function to be optimized. Other GA parameters may also be specified by the user. Simulation results and performance analyses of the HGA are presented. A prototype HGA is described and compared to a similar GA implemented in software. In the simple tests, the prototype took about 6{\%} as many clock cycles to run as the software-based GA. Further suggested improvements could realistically make the HGA 2-3 orders of magnitude faster than the software-based GA.",
author = "Scott, {Stephen D.} and Ashok Samal and Sharad Seth",
year = "1995",
month = "1",
day = "1",
language = "English (US)",
pages = "53--59",
note = "Proceedings of the 1995 ACM 3rd International Symposium on Field-Programmable Gate Arrays ; Conference date: 12-02-1995 Through 14-02-1995",

}

TY - CONF

T1 - HGA

T2 - a hardware-based genetic algorithm

AU - Scott, Stephen D.

AU - Samal, Ashok

AU - Seth, Sharad

PY - 1995/1/1

Y1 - 1995/1/1

N2 - A genetic algorithm (GA) is a robust problem-solving method based on natural selection. Hardware's speed advantage and its ability to parallelize offer great rewards to genetic algorithms Speedups of 1-3 orders of magnitude have been observed when frequently used software routines were implemented in hardware by way of reprogrammable field-programmable gate arrays (FPGAs). Reprogrammability is essential in a general-purpose GA engine because certain GA modules require changeability (e.g. the function to be optimized by the GA). Thus a hardware-based GA is both feasible and desirable. A fully functional hardware-based genetic algorithm (the HGA) is presented here as a proof-of-concept system. It was designed using VHDL to allow for easy scalability. It is designed to act as a coprocessor with the CPU of a PC. The user programs the FPGAs which implement the function to be optimized. Other GA parameters may also be specified by the user. Simulation results and performance analyses of the HGA are presented. A prototype HGA is described and compared to a similar GA implemented in software. In the simple tests, the prototype took about 6% as many clock cycles to run as the software-based GA. Further suggested improvements could realistically make the HGA 2-3 orders of magnitude faster than the software-based GA.

AB - A genetic algorithm (GA) is a robust problem-solving method based on natural selection. Hardware's speed advantage and its ability to parallelize offer great rewards to genetic algorithms Speedups of 1-3 orders of magnitude have been observed when frequently used software routines were implemented in hardware by way of reprogrammable field-programmable gate arrays (FPGAs). Reprogrammability is essential in a general-purpose GA engine because certain GA modules require changeability (e.g. the function to be optimized by the GA). Thus a hardware-based GA is both feasible and desirable. A fully functional hardware-based genetic algorithm (the HGA) is presented here as a proof-of-concept system. It was designed using VHDL to allow for easy scalability. It is designed to act as a coprocessor with the CPU of a PC. The user programs the FPGAs which implement the function to be optimized. Other GA parameters may also be specified by the user. Simulation results and performance analyses of the HGA are presented. A prototype HGA is described and compared to a similar GA implemented in software. In the simple tests, the prototype took about 6% as many clock cycles to run as the software-based GA. Further suggested improvements could realistically make the HGA 2-3 orders of magnitude faster than the software-based GA.

UR - http://www.scopus.com/inward/record.url?scp=0029204501&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029204501&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0029204501

SP - 53

EP - 59

ER -