GA-based algorithm for hardware/software partitioning with resource contentions

In embedded system design, hardware/software (HW/SW) partitioning is the NP-complete problem which searches reasonable composition of hardware and software components which not only satisfies the constraint of hardware but also optimizes the execution time. Blocks derive from the functional specific...

Full description

Saved in:
Bibliographic Details
Published in2010 2nd International Conference on Advanced Computer Control Vol. 1; pp. 68 - 72
Main Authors Shuang Dou, Shan Ding, Shi Zhang, Liucun Zhu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2010
Subjects
Constraint optimization
Design optimization
Embedded software
Embedded system
Flow graphs
Genetic algorithm
Hardware
Hardware/software partitioning
NP-complete problem
Partitioning algorithms
Resource contentions
Software algorithms
Software design
Online AccessGet full text
ISBN1424458455
9781424458455
DOI10.1109/ICACC.2010.5486783

Cover

More Information
Summary:In embedded system design, hardware/software (HW/SW) partitioning is the NP-complete problem which searches reasonable composition of hardware and software components which not only satisfies the constraint of hardware but also optimizes the execution time. Blocks derive from the functional specification internally represented as control/data flow graph. In this paper, the model of the embedded system is extended so that resource contentions are taken into account. A GA-based algorithm is proposed on the basic of the model, in which "serial blocks" are calculated by NAP. The algorithm can lead to a more precise design space exploration. Experimental results show that, comparison with exhaustive search method, the algorithm we proposed can be conveniently implemented HW/SW partitioning with resource contentions.
ISBN:1424458455
9781424458455
DOI:10.1109/ICACC.2010.5486783