Scheduling dynamic dataflow graphs with bounded memory using the token flow model

Authors:
Joseph T. Buck;Edward A. Lee
Affiliations:
Dept. of EECS, University of California, Berkeley, CA;Dept. of EECS, University of California, Berkeley, CA
Venue:
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
Year:
1993

Citing 4
Cited 7

Multiprocessor scheduling to account for interprocessor communication

Multiprocessor scheduling to account for interprocessor communication
Compile-time scheduling of dataflow program graphs with dynamic constructs

Compile-time scheduling of dataflow program graphs with dynamic constructs
Gabriel: A Design Environment for DSP

IEEE Micro
Consistency in Dataflow Graphs

IEEE Transactions on Parallel and Distributed Systems

Overview of the MPEG Reconfigurable Video Coding Framework

Journal of Signal Processing Systems
Energy-driven partitioning of signal processing algorithms in sensor networks

SAMOS'06 Proceedings of the 6th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
Heterogeneous design in functional DIF

Transactions on High-Performance Embedded Architectures and Compilers IV
Automatic dataflow model extraction from modal real-time stream processing applications

Proceedings of the 14th ACM SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Mathematical formalisms for performance evaluation of networks-on-chip

ACM Computing Surveys (CSUR)
SPDF: a schedulable parametric data-flow MoC

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Design space exploration for streaming applications on multiprocessors with guaranteed service NoC

Proceedings of the Sixth International Workshop on Network on Chip Architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper builds upon research by Lee [1] concerning the token flow model, an analytical model for the behavior of dataflow graphs with data-dependent control flow, by analyzing the properties of cycles of the schedule: sequences of actor executions that return the graph to its initial state. Necessary and sufficient conditions are given for the existence of a bounded cyclic schedule, as well as sufficient conditions for execution of the graph in bounded memory. The techniques presented in this paper apply to a more general class of dataflow graphs than existing methods.