Abstract
In recent years, meta-heuristics have become increasingly interesting in solving combinatorial problems including hardware-software partitioning. In this paper, we 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 hardwaresoftware partitioning. In fact, meta-heuristics can produce acceptable solutions within a reasonable time, but they do not guarantee an optimal solution. We 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. This paper presents an analysis of these meta-heuristics by identifying the fundamental ideas guiding the choice of a meta-heuristic in practice.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
