Retiming for Synchronous Data Flow Graphs

  • Authors:
  • N. Liveris;C. Lin;J. Wang;H. Zhou;P. Banerjee

  • Affiliations:
  • Northwestern Univ., Evanston, IL;Northwestern Univ., Evanston, IL;Northwestern Univ., Evanston, IL;Northwestern Univ., Evanston, IL;Northwestern Univ., Evanston, IL

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a new algorithm for retiming synchronous dataflow (SDF) graphs. The retiming aims at minimizing the cycle length of an SDF. The algorithm is provably optimal and its execution time is improved compared to previous approaches.