A hardware/software partitioning algorithm for SIMD processor cores

  • Authors:
  • Koichi Tachikake;Nozomu Togawa;Yuichiro Miyaoka;Jinku Choi;Masao Yanagisawa;Tatsuo Ohtsuki

  • Affiliations:
  • Waseda University, Shinjuku, Tokyo, Japan;The University of Kitakyushu;Waseda University, Shinjuku, Tokyo, Japan;Waseda University, Shinjuku, Tokyo, Japan;Waseda University, Shinjuku, Tokyo, Japan;Waseda University, Shinjuku, Tokyo, Japan

  • Venue:
  • ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a new hardware/software partitioning algorithm for processor cores with SIMD instructions. Given a compiled assembly code including SIMD instructions, a timing constraint of execution time, and available hardware units, the proposed algorithm synthesizes an area-optimized processor core with a new assembly code. Firstly, we assume an initial processor core on which an input assembly code can run with the shortest execution time. Secondly we reduce a hardware unit added to a processor core one by one while the timing constraint is satisfied. At the same time, we update the assembly code so that it can run on the new processor configuration. By repeating this process, we finally obtain a processor core architecture with small area under the given timing constraint. We expect that we can obtain a processor core which has appropriate SIMD functional units for running the input application program. The promising experimental results are also shown.