Dynamic data flow and control flow in high level DSP code synthesis

Pankert, M.; Mauss, O.C.; Ritz, S.; Meyr, H.

doi:10.1109/icassp.1994.389614

Cited by 29 publications

(27 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bounded dynamic dataflow (BDDF), introduced by Pankert et al [58], allows arbitrary data rates as long as an upper bound is specified for the data rate of each dynamic port. The application of VTS shown here is similar to BDDF in the sense that it requires bounds on dynamic behavior.…”

Section: Variable Token Size (Vts) Modelmentioning

confidence: 99%

Design Methodology for Embedded Computer Vision Systems

Bhattacharyya

Saha

2009

Embedded Computer Vision

View full text Add to dashboard Cite

Computer vision has emerged as one of the most popular domains of embedded applications. Though various new powerful embedded platforms to support such applications have emerged in recent years, there is a distinct lack of efficient domain-specific synthesis techniques for optimized implementation of such systems. In this thesis, four different aspects that contribute to efficient design and synthesis of such systems are explored:(1) Graph Transformations: Dataflow modeling is widely used in digital signal processing (DSP) systems. However, support for dynamic behavior in such systems exists mainly at the modeling level and there is a lack of optimized synthesis techniques for these models. New transformation techniques for efficient system-on-chip (SoC) design methods are proposed and implemented for cyclo-static dataflow and its parameterized version (parameterized cyclo-static dataflow) -two powerful models that allow dynamic reconfigurability and phased behavior in DSP systems.

show abstract

Section: Variable Token Size (Vts) Modelmentioning

confidence: 99%

Design Methodology for Embedded Computer Vision Systems

Bhattacharyya

Saha

2009

Embedded Computer Vision

View full text Add to dashboard Cite

show abstract

“…However, when in every execution of w b the consumption is two, then for any non-terminating schedule a finite buffer capacity only exists if the execution rate of task w a is reduced. Cyclodynamic [13] and bounded dynamic dataflow [9] also apply run-time scheduling, but do not provide algorithms to compute buffer capacities that guarantee the existence of a non-terminating schedule, let alone satisfy a throughput constraint.…”

Section: Related Workmentioning

confidence: 99%

Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication

Wiggers¹,

Bekooij²

2008

2008 Design, Automation and Test in Europe

View full text Add to dashboard Cite

show abstract

“…In parameterized dataflow [1], dynamic reconfiguration of actor and subsystem parameters is allowed through separation of functionality into subgraphs that perform reconfiguration and subgraphs that are periodically reconfigured. Boolean [4], bounded dynamic [6], and cyclo-dynamic [10] dataflow offer dynamically varying production and consumption rates by incorporating various other data-dependent modeling constructs.…”

Section: Related Workmentioning

confidence: 99%

Analysis of Dataflow Programs with Interval-limited Data-rates

Teich

Bhattacharyya

2006

J VLSI Sign Process Syst Sign Image Video Technol

View full text Add to dashboard Cite

In this paper, we consider the problem of analyzing data flow programs with the property that actor production and consumption rates are not constant and fixed, but limited by intervals. Such interval ranges may result from uncertainty in the specification of an actor or as a design freedom of the model. Major questions such as consistency and buffer memory requirements for singleprocessor schedules will be analyzed here for such specifications for the first time. MotivationThe role of data flow models of computation is becoming increasingly important for modeling and synthesis of digital processing applications. Our paper is concerned with analyzing dataflow graphs whose component data rates are not known precisely in advance. Such models are often given due to imprecise specifications or due to uncertainties in the implementation. Examples of imprecise specifications include unknown execution times of tasks, unknown data rates, unknown consumption and production behavior of modules and many more. For example, a speech compression system may have a fixed overall structure. However, the subsystem data rates are typically influenced by the size of the speech segment that is to be processed [1]. Here, we will propose a data flow model of computation that is able to model such uncertain behavior.To understand such models, it useful to first review principles of the synchronous data flow (SDF) model of computation, where production and consumption rates of data flow actors, representing computational blocks, consume fixed, known amounts of data (tokens) upon each invocation. For such graph models, often represented by a graph in which actors are connected by directed arcs that transport tokens, many interesting results have been shown such as 1) consistency, 2) memory bounds and memory analysis, and 3) scheduling algorithms. Consistency, e.g., is a static property of an SDF-graph specification which is necessary in order to guarantee the existence of a finite sequence of actor firings, also called a schedule. Typically, an SDF specification is compiled by constructing a valid schedule, i.e., a schedule that fires each actor at least once, does not deadlock, and produces no net change in the number of tokens queued on each edge. For each actor firing, a corresponding code block is instantiated from a library to produce machine code.In [5], efficient algorithms are presented to determine whether or not a given SDF graph is consistent or not and to determine the minimum number of firings of each actor §

show abstract

Dynamic data flow and control flow in high level DSP code synthesis

Cited by 29 publications

References 6 publications

Design Methodology for Embedded Computer Vision Systems

Design Methodology for Embedded Computer Vision Systems

Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication

Analysis of Dataflow Programs with Interval-limited Data-rates

Contact Info

Product

Resources

About