Algorithmic aspects for power-efficient hardware/software partitioning

Jigang Wu, Thambipillai Srikanthan and Chengbin Yan

Mathematics and Computers in Simulation (MATCOM), 2008, vol. 79, issue 4, 1204-1215

Abstract: 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(nlog⁡n) 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% for the cases simulated in this paper.

Keywords: Algorithm; Heuristic; Dynamic programming; Hardware/software partitioning; Complexity (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475407002534
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:79:y:2008:i:4:p:1204-1215

DOI: 10.1016/j.matcom.2007.09.003

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().