1992•Unpublished venueRequires access

Well-behaved dataflow programs for DSP computation

Guang R. Gao, R. Govindarajan, Prakash Panangaden

Abstract

Accumulation of tokens on the arcs of a dataflow program operating on potentially infinite streams in a DSP computation leads to unbounded storage requirement. Compile-time techniques to determine the storage requirement are essential for efficient scheduling. A class of program graphs called regular stream flow graphs is studied. Restricting the construction to a set of construction rules facilitates compile-time predictability of storage requirement. Compared to existing methods, the model has a stronger verifiability, which is due to the structure of the well-constructed graphs.>

About this research paper

What this paper is about

Why it matters

OpenAlex reports 67 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Dataflow, Computer science, Compile time, Compiler, Computation, Programming language, Scheduling (production processes), Set (abstract data type)