کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1141201 | 956767 | 2008 | 12 صفحه PDF | دانلود رایگان |
Power efficiency is one of the major considerations in the current hardware/software co-designs. This paper models hardware/software partitioning as an optimization problem with objective of minimizing power consumption under the constraints: hardware area A and execution time E. An efficient heuristic algorithm with running time O(nlogn)O(nlogn) is proposed for the quality approximate solutions of the problems with n code fragments. Also, an exact algorithm based on dynamic programming is presented to produce the optimal solution in O(n⋅A⋅E). The optimal solution for small-sized problems is used to evaluate the performance of the approximate solution. The approximate solutions are compared experimentally with the optimal solutions in our empirical study. The average errors of the approximate solutions is less than 0.9%0.9% for the cases simulated in this paper.
Journal: Mathematics and Computers in Simulation - Volume 79, Issue 4, 15 December 2008, Pages 1204–1215