.png){kind=icon}
.png){kind=icon}
Return
Algorithms for bi-objective multiple-choice hardware/software partitioning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2016.01.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes three algorithms for multiple-choice hardware-software partitioning with the objectives of minimizing execution time and power consumption, while meeting area constraint. Firstly, a heuristic algorithm is proposed to rapidly generate an approximate solution. In the second algorithm we refined the approximate solution using a customized tabu search algorithm. Finally, a dynamic programming algorithm is proposed to calculate the exact solution. Simulation results show that the approximate solution is very close to the exact solution. This can be further refined by tabu search to achieve a solution with less than 1.5% error for all cases considered in this paper. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Multiple choice
Hardware/software partitioning
Bi-objective
Power consumption
Algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
View more organizations