Bus optimization for low-power data path synthesis based on network flow method

  • Authors:
  • Sungpack Hong;Taewhan Kim

  • Affiliations:
  • Advanced Information Technology Research Center (AITrc), KAIST, Taejon, KOREA;Advanced Information Technology Research Center (AITrc). KAIST, Taejon, KOREA

  • Venue:
  • Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral level and RT level of design. This paper addresses the problem of minimizing power dissipated in switching of the buses in data path synthesis. Unlike the previous approaches in which minimization of the power consumed in buses has not been considered until operation scheduling is completed, our approach integrates the bus binding problem into scheduling to exploit the impact of scheduling on reduction of power dissipated on the buses more fully and effectively. We accomplish this by formulating the problem into a flow problem in a network, and devising an efficient algorithm which iteratively finds maximum flow of minimum cost solutions in the network. Experimental results on a number of benchmark problems show that given resource and global timing constraints our designs are 22% power-efficient over the designs produced by a random-move based solution, and 18% power-efficient over the designs by a clock-step based optimal solution.