Finding optimal hardware/software partitions

  • Authors:
  • Zoltán Ádám Mann;András Orbán;Péter Arató

  • Affiliations:
  • Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Budapest, Hungary 1117;Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Budapest, Hungary 1117;Department of Control Engineering and Information Technology, Budapest University of Technology and Economics, Budapest, Hungary 1117

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most previous approaches to hardware/software partitioning considered heuristic solutions. In contrast, this paper presents an exact algorithm for the problem based on branch-and-bound. Several techniques are investigated to speed up the algorithm, including bounds based on linear programming, a custom inference engine to make the most out of the inferred information, advanced necessary conditions for partial solutions, and different heuristics to obtain high-quality initial solutions. It is demonstrated with empirical measurements that the resulting algorithm can solve highly complex partitioning problems in reasonable time. Moreover, it is about ten times faster than a previous exact algorithm based on integer linear programming. The presented methods can also be useful in other related optimization problems.