Exploiting statically schedulable regions in dataflow programs

  • Authors:

  • Ruirui Gu;Jorn W. Janneck;Mickael Raulet;Shuvra S. Bhattacharyya

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Maryland, College Park, 20742, USA;Xilinx, Inc. San Jose, CA, USA;IETR Laboratory, UMR CNRS 6164, Image and Remote Sensing Group, 35043 RENNES Cedex, FRANCE;Department of Electrical and Computer Engineering, University of Maryland, College Park, 20742, USA

  • Venue:
  • ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dataflow descriptions have been used in a wide range of Digital Signal Processing (DSP) applications, such as multi-media processing, and wireless communications. Among various forms of dataflow modeling, Synchronous Dataflow (SDF) is geared towards static scheduling of computational modules, which improves system performance and predictability. However, many DSP applications do not fully conform to the restrictions of SDF modeling. More general dataflow models, such as CAL [1], have been developed to describe dynamically-structured DSP applications. Such generalized models can express dynamically changing functionality, but lose the powerful static scheduling capabilities provided by SDF. This paper focuses on detection of SDF-like regions in dynamic dataflow descriptions — in particular, in the generalized specification framework of CAL. This is an important step for applying static scheduling techniques within a dynamic dataflow framework. Our techniques combine the advantages of different dataflow languages and tools, including CAL [1], DIF [2] and CAL2C [3]. The techniques are demonstrated on the IDCT module of MPEG Reconfigurable Video Coding (RVC).