International Journal of Computer Applications
In recent years, meta-heuristics have become increasingly interesting in solving combinatorial problems including hardware-software partitioning. In this paper, the authors present a comparative study between some algorithms which involve meta-heuristics based on Tabu-search, genetic algorithm and binary search trees to address the problem of hardware-software partitioning. In fact, meta-heuristics can produce acceptable solutions within a reasonable time, but they do not guarantee an optimal solution. They have proposed these algorithms to find the efficient hardware-software partition that minimizes the logic area of system on a programmable chip while respecting a time constraint.