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 represe...

Full description

Saved in:
Bibliographic Details
Main Authors: Hsiang-Huang Wu, Chung-Ching Shen, Sane, N., Plishker, W., Bhattacharyya, S. S.
Format: Conference Proceeding
Language:English
Subjects:
Computational modeling
Dynamic scheduling
Processor scheduling
Program processors
Schedules
Semantics
Synchronization
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1530-2075
DOI:10.1109/IPDPS.2011.128