A Model-Based Schedule Representation for Heterogeneous Mapping of Dataflow Graphs

Dataflow-based application specifications are widely used in model-based design methodologies for signal processing systems. In this paper, we develop a new model called the dataflow schedule graph (DSG) for representing a broad class of dataflow graph schedules. The DSG provides a graphical representation of schedules based on dataflow semantics. In conventional approaches, applications are represented using dataflow graphs, whereas schedules for the graphs are represented using specialized notations, such as various kinds of sequences or looping constructs. In contrast, the DSG approach employs dataflow graphs for representing both application models and schedules that are derived from them. Our DSG approach provides a precise, formal framework for unambiguously representing, analyzing, manipulating, and interchanging schedules. We develop detailed formulations of the DSG representation, and present examples and experimental results that demonstrate the utility of DSGs in the context of heterogeneous signal processing system design.

[1]  Sander Stuijk,et al.  Throughput Analysis of Synchronous Data Flow Graphs , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[2]  Shuvra S. Bhattacharyya,et al.  Rapid prototyping for digital signal processing systems using Parameterized Synchronous Dataflow graphs , 2010, Proceedings of 2010 21st IEEE International Symposium on Rapid System Protyping.

[3]  E.A. Lee,et al.  Synchronous data flow , 1987, Proceedings of the IEEE.

[4]  A. A. Maciejewski,et al.  Heterogeneous Computing , 2002 .

[5]  Ed F. Deprettere,et al.  Modeling Stream-Based Applications Using the SBF Model of Computation , 2001, J. VLSI Signal Process..

[6]  Shuvra S. Bhattacharyya,et al.  Efficient techniques for clustering and scheduling onto embedded multiprocessors , 2006, IEEE Transactions on Parallel and Distributed Systems.

[7]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[8]  Rudy Lauwereins,et al.  Data memory minimisation for synchronous data flow graphs emulated on DSP-FPGA targets , 1997, DAC.

[9]  Shuvra S. Bhattacharyya,et al.  Embedded Multiprocessors: Scheduling and Synchronization , 2000 .

[10]  Shuvra S. Bhattacharyya,et al.  A Lightweight Dataflow Approach for Design and Implementation of SDR Systems , 2010 .

[11]  Shuvra S. Bhattacharyya,et al.  Functional DIF for Rapid Prototyping , 2008, 2008 The 19th IEEE/IFIP International Symposium on Rapid System Prototyping.

[12]  Edward A. Lee,et al.  Compile-time scheduling of dynamic constructs in dataflow program graphs , 1997 .

[13]  Rainer Leupers,et al.  Software synthesis and code generation for signal processing systems , 2000 .

[14]  Sander Stuijk,et al.  A scenario-aware data flow model for combined long-run average and worst-case performance analysis , 2006, Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings..

[15]  Ed F. Deprettere,et al.  Parameterized Looped Schedules for Compact Representation of Execution Sequences in DSP Hardware and Software Implementation , 2007, IEEE Transactions on Signal Processing.

[16]  Rainer Leupers,et al.  Handbook of Signal Processing Systems , 2010 .

[17]  Soonhoi Ha,et al.  Memory optimal single appearance schedule with dynamic loop count for synchronous dataflow graphs , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[18]  Shuvra S. Bhattacharyya,et al.  Parameterized dataflow modeling of DSP systems , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[19]  Shuvra S. Bhattacharyya,et al.  Heterogeneous Design in Functional DIF , 2008, SAMOS.

[20]  Edward A. Lee,et al.  Scheduling dynamic dataflow graphs with bounded memory using the token flow model , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[21]  Tao Yang,et al.  On the Granularity and Clustering of Directed Acyclic Task Graphs , 1993, IEEE Trans. Parallel Distributed Syst..