Static scheduling and code generation from dynamic dataflow graphs with integer-valued control streams

Author

Buck, Joseph T.

Author_Institution

Synopsys Inc., Mountain View, CA, USA

Volume

1

fYear

1994

fDate

31 Oct-2 Nov 1994

Firstpage

508

Abstract

This paper extends the token flow model of Buck (see Memorandum No. UCB/ERL M93/69 (Ph.D. Thesis), EECS Dept., University of California, Berkeley, September 1993) and Lee (see IEEE Transactions on Parallel and Distributed Systems, vol.2, no.2, 1991), an analytical model for the behavior of dataflow graphs with data-dependent control flow, in two ways: dataflow actor execution may depend on integer rather than Boolean, control tokens, and multiphase implementations of actors are permitted. These extensions permit data-dependent iteration to be modelled more naturally, reduce the memory required for implementations, and result in bounded-memory solutions in more cases than before. A method for generating efficient single-processor programs from the graphs is also described

Keywords

data flow graphs; integer programming; iterative methods; processor scheduling; signal processing; analytical model; bounded-memory solutions; code generation; data-dependent control flow; data-dependent iteration; dataflow actor execution; digital signal processing; dynamic dataflow graphs; integer-valued control streams; memory requirements reduction; multiphase implementations; single-processor programs; static scheduling; token flow model; Analytical models; Decision making; Digital signal processing; Dynamic scheduling; Processor scheduling; Signal processing algorithms; Signal synthesis; Software algorithms; Software tools; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1994. 1994 Conference Record of the Twenty-Eighth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

0-8186-6405-3

Type

conf

DOI

10.1109/ACSSC.1994.471505

Filename

471505