A metaheuristic based on the tabu search for hardware-software partitioning

Authors

MEHDI JEMAI
SONIA DIMASSI
BOURAOUI OUNI
ABDELLATIF MTIBAA

DOI

10.3906/elk-1501-64

Abstract

Several metaheuristics have become increasingly interesting in solving combinatorial problems. In this paper, we present an algorithm involving a metaheuristic based on tabu search and binary search trees to address the problem of hardware-software partitioning. Metaheuristics do not guarantee an optimum solution, but they can produce acceptable solutions in a reasonable time. Our proposed algorithm seeks to find the efficient hardware-software partitioning that minimizes the logic area of a system on a programmable chip under the condition of time constraints. Our goal is to have a better trade-off between the logic area of the application and its execution time. Finally, we compare our algorithm to some metaheuristic-based algorithms.

Keywords

Combinatorial optimization, heuristics, metaheuristics, neighborhood search, tabu search, hardware-software partitioning

First Page

901

Last Page

912

Recommended Citation

JEMAI, MEHDI; DIMASSI, SONIA; OUNI, BOURAOUI; and MTIBAA, ABDELLATIF (2017) "A metaheuristic based on the tabu search for hardware-software partitioning," Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 25: No. 2, Article 20. https://doi.org/10.3906/elk-1501-64
Available at: https://journals.tubitak.gov.tr/elektrik/vol25/iss2/20