Abstract
| Language | English |
|---|---|
| Pages | 263-274 |
| Journal | Microprocessors and Microsystems |
| Volume | 25 |
| Issue number | 5 |
| Publication status | Published - Aug 2001 |
Fingerprint
Cite this
}
Genetic Algorithm Driven Hardware-Software Partitioning for Dynamically Reconfigurable Emnbedded Systems. / Harkin, JG; McGinnity, TM; Maguire, LP.
Vol. 25, No. 5, 08.2001, p. 263-274.Research output: Contribution to journal › Article
TY - JOUR
T1 - Genetic Algorithm Driven Hardware-Software Partitioning for Dynamically Reconfigurable Emnbedded Systems
AU - Harkin, JG
AU - McGinnity, TM
AU - Maguire, LP
PY - 2001/8
Y1 - 2001/8
N2 - The need for inexpensive, compact and adaptive systems prompted considerable interest in the hardware–software co-design of embedded systems. In particular, Dynamically Reconfigurable Embedded Systems, which exploit the advances in Field Programmable Gate Array (FPGA) technology, facilitate customisation of their hardware resources during runtime to meet the demands of executing applications. The ability to estimate the resultant acceleration obtained is highly desirable, as time to market deadlines are being ever shortened. The performance of such systems is fundamentally dependent on the hardware–software partition. In this paper, a genetic algorithm-based (GA) hardware–software partitioning method is presented. Demonstrative applications are used to illustrate the effectiveness of the GA approach at exploiting the inherent reconfigurable nature of such systems to obtain optimal or near optimal performance speedup relative to a conventional software implementation. Author Keywords: HW–SW partitioning; Dynamic reconfiguration; Genetic algorithms
AB - The need for inexpensive, compact and adaptive systems prompted considerable interest in the hardware–software co-design of embedded systems. In particular, Dynamically Reconfigurable Embedded Systems, which exploit the advances in Field Programmable Gate Array (FPGA) technology, facilitate customisation of their hardware resources during runtime to meet the demands of executing applications. The ability to estimate the resultant acceleration obtained is highly desirable, as time to market deadlines are being ever shortened. The performance of such systems is fundamentally dependent on the hardware–software partition. In this paper, a genetic algorithm-based (GA) hardware–software partitioning method is presented. Demonstrative applications are used to illustrate the effectiveness of the GA approach at exploiting the inherent reconfigurable nature of such systems to obtain optimal or near optimal performance speedup relative to a conventional software implementation. Author Keywords: HW–SW partitioning; Dynamic reconfiguration; Genetic algorithms
UR - http://www.elsevier.com/locate/micpro
M3 - Article
VL - 25
SP - 263
EP - 274
IS - 5
ER -