Algorithmic aspects of area-efficient hardware/software partitioning

  • Authors:
  • Wu Jigang;Thambipillai Srikanthan

  • Affiliations:
  • Centre for High Performance Embedded Systems, Nanyang Technological University, Singapore 639798;Centre for High Performance Embedded Systems, Nanyang Technological University, Singapore 639798

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Area efficiency is one of the major considerations in constraint aware hardware/software partitioning process. This paper focuses on the algorithmic aspects for hardware/software partitioning with the objective of minimizing area utilization under the constraints of execution time and power consumption. An efficient heuristic algorithm running in O(n log n) is proposed by extending the method devised for solving the 0-1 knapsack problem. Also, an exact algorithm based on dynamic programming is proposed to produce the optimal solution for small-sized problems. Simulation results show that the proposed heuristic algorithm yields very good approximate solutions while dramatically reducing the execution time.