Software-Hardware Partitioning Strategy Using Hybrid Genetic and Tabu Search

Authors:
Lanying Li;Min Shi
Affiliations:
-;-
Venue:
CSSE '08 Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 04
Year:
2008

Citing 0
Cited 3

Using Tabu Search to Estimate Software Development Effort

IWSM '09 /Mensura '09 Proceedings of the International Conferences on Software Process and Product Measurement
Evaluation of runtime task mapping using the rSesame framework

International Journal of Reconfigurable Computing - Special issue on Selected Papers from the International Conference on Reconfigurable Computing and FPGAs (ReConFig'10)
A dependency aware task partitioning and scheduling algorithm for hardware-software codesign on MPSoCs

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most crucial steps in the design of embedded systems is deciding which components of the system should be implemented in software and which ones in hardware. Inspired by genetic algorithm (GA) and tabu search (TS), this paper puts forward a hybrid strategy (GATS) to solve the software-hardware partitioning problem in embedded system. The main frame of GATS is provided by genetic algorithm and the tabu search is taken as the mutation operator. Here the tabu search is used for the solution space in the process of mutation. And the results show that GATS has multiple starting-points, strong mountain-climbing ability and memory function instead of inferior mountain-climbing ability of GA and the single starting-point feature of TS. The experimental results indicate that GATS is superior to the single GA and TS in terms of both required time and system cost, which testify the effectiveness of GATS and produce better portioning results.