A model-based schedule representation for heterogeneous mapping of dataflow graphs

Hsiang Huang Wu; Chung Ching Shen; Nimish Sane; William Plishker; Shuvra S. Bhattacharyya

doi:10.1109/IPDPS.2011.128

A model-based schedule representation for heterogeneous mapping of dataflow graphs

Hsiang Huang Wu^*
, Chung Ching Shen
, Nimish Sane
, William Plishker
, Shuvra S. Bhattacharyya

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

7 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	2011 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2011
Pages	70-81
Number of pages	12
DOIs	https://doi.org/10.1109/IPDPS.2011.128
Publication status	Published - 2011
Publication type	A4 Article in conference proceedings
Event	25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011 - Anchorage, AK, United States Duration: 16 May 2011 → 20 May 2011

Conference

Conference	25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011
Country/Territory	United States
City	Anchorage, AK
Period	16/05/11 → 20/05/11

Keywords

Dataflow graphs
Heterogeneous computing
Models of computation
Scheduling

ASJC Scopus subject areas

Computational Theory and Mathematics
Software
Theoretical Computer Science

Access to Document

10.1109/IPDPS.2011.128

Cite this

@inproceedings{2323bc62e9154e6f984b1d2f4a9b21ac,

title = "A model-based schedule representation for heterogeneous mapping of dataflow graphs",

abstract = "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.",

keywords = "Dataflow graphs, Heterogeneous computing, Models of computation, Scheduling",

author = "Wu, \{Hsiang Huang\} and Shen, \{Chung Ching\} and Nimish Sane and William Plishker and Bhattacharyya, \{Shuvra S.\}",

year = "2011",

doi = "10.1109/IPDPS.2011.128",

language = "English",

isbn = "9780769543857",

pages = "70--81",

booktitle = "2011 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2011",

note = "25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011 ; Conference date: 16-05-2011 Through 20-05-2011",

}

Wu, HH, Shen, CC, Sane, N, Plishker, W & Bhattacharyya, SS 2011, A model-based schedule representation for heterogeneous mapping of dataflow graphs. in 2011 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2011., 6008822, pp. 70-81, 25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011, Anchorage, AK, United States, 16/05/11. https://doi.org/10.1109/IPDPS.2011.128

A model-based schedule representation for heterogeneous mapping of dataflow graphs. / Wu, Hsiang Huang; Shen, Chung Ching; Sane, Nimish et al.
2011 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2011. 2011. p. 70-81 6008822.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - A model-based schedule representation for heterogeneous mapping of dataflow graphs

AU - Wu, Hsiang Huang

AU - Shen, Chung Ching

AU - Sane, Nimish

AU - Plishker, William

AU - Bhattacharyya, Shuvra S.

PY - 2011

Y1 - 2011

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

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

KW - Dataflow graphs

KW - Heterogeneous computing

KW - Models of computation

KW - Scheduling

UR - https://www.scopus.com/pages/publications/83455253826

U2 - 10.1109/IPDPS.2011.128

DO - 10.1109/IPDPS.2011.128

M3 - Conference contribution

AN - SCOPUS:83455253826

SN - 9780769543857

SP - 70

EP - 81

BT - 2011 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2011

T2 - 25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011

Y2 - 16 May 2011 through 20 May 2011

ER -

A model-based schedule representation for heterogeneous mapping of dataflow graphs

Abstract

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this