Optimum vectorization of scalable synchronous dataflow graphs

Ritz, S.; Pankert, M.; Zivojinovic, V.; Meyr, H.

doi:10.1109/asap.1993.397152

Cited by 75 publications

(80 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, the overlapping of SDF input/output buffers by systematically applying CBP analysis does not emerge in any straightforward way from the more general techniques developed by Verbauwhede et al [22]. Our form of buffer merging using the CBP parameter is especially well-suited for incorporation with the SDF vectorization techniques (for minimizing contextswitch overhead) developed by Ritz et al [23] since the absence of nested loops in the vectorized schedules allows for more flexible merging of input/output buffers. Buffer merging is also compatible with buffer access enhancements such as polyphase filter implementation [24,25], and cyclo-static dataflow specification [26].…”

Section: Related Workmentioning

confidence: 99%

The CBP Parameter: A Module Characterization Approach for DSP Software Optimization

Bhattacharyya

Murthy

2004

The Journal of VLSI Signal Processing-Systems for Signal, Image

View full text Add to dashboard Cite

Abstract. Memory consumption is an important metric for DSP software implementation. In this paper, we develop a module characterization technique that promotes more economical use of memory resources at the system level. Our work is developed in the context of software synthesis from signal/video/image processing applications expressed as synchronous dataflow (SDF) graphs. SDF is a restricted form of dataflow where each computational module (actor) consumes and produces a fixed number of data values (tokens) on each execution. Usually, no assumption is made about when during the execution of an actor, the tokens are actually consumed and produced; the firing of an actor is treated as an atomic event for most purposes. However, we show in this paper that it is possible to concisely and precisely capture key properties pertaining to the relative times at which tokens are produced and consumed by an actor. We show this by introducing the consumed-before-produced (CBP) parameter, which provides a general method for characterizing the token transfer of an SDF actor. Good bounds on the CBP parameter can aid an SDF compiler in performing more aggressive optimizations for reducing buffer sizes on the edges between actors. We formally define the CBP parameter; derive some useful properties of this parameter; illustrate how the value of the parameter is derived by examining in detail the multirate FIR filter, which is a fundamental actor in multirate signal processing applications; and examine CBP parameterizations for several other practical SDF actors.

show abstract

Section: Related Workmentioning

confidence: 99%

The CBP Parameter: A Module Characterization Approach for DSP Software Optimization

Bhattacharyya

Murthy

2004

The Journal of VLSI Signal Processing-Systems for Signal, Image

View full text Add to dashboard Cite

show abstract

“…In particular, the overlapping of SDF input/output buffers by shifting actor read and write pointers does not emerge in any straightforward way from the more general techniques developed in [16]. Our form of buffer merging is especially well-suited for incorporation with the SDF vectorization techniques (for minimizing context-switch overhead) developed at the Aachen University of Technology [13] since the absence of nested loops in the vectorized schedules allows for more flexible merging of input/output buffers.…”

Section: Introductionmentioning

confidence: 99%

“…Block diagram environments for DSPs have proliferated recently, with industrial tools like DSPCanvas from Angeles Design Systems, and COSSAP [13] from Synopsys, and academic tools like Ptolemy [4] from UC Berkeley, and GRAPE [6] from K. U. Leuven. Reasons for their popularity include ease-of-use, intuitive semantics, modularity, and strong formal properties of the underlying dataflow models.…”

Section: Introductionmentioning

confidence: 99%

Systematic consolidation of input and output buffers in synchronous dataflow specifications

Murthy¹,

Bhattacharyya²

2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528)

View full text Add to dashboard Cite

-Synchronous Dataflow, a subset of dataflow, is a commonly used model of computation in block diagram DSP programming environments. Because of the limited amount of memory in embedded DSPs, a key problem during software synthesis from SDF specifications is the minimization of the memory used by the target code. We develop a powerful formal technique called buffer merging that attempts to overlay buffers in the SDF graph systematically in order to drastically reduce data buffering requirements. This technique is complementary to lifetime-analysis based approaches, and we show that it can be fruitfully combined to yield a hybrid algorithm that results in less memory usage than either technique used alone. We give polynomial-time algorithms based on this formalism, and show that code synthesized using this technique results in a 45% reduction, on average, of the buffering memory consumption compared to existing techniques.

show abstract

“…The actor maps the B samples into an M × B bit stream. This actor has two parameters: M for the number of bits per sample, and B for the vectorization degree (see [17] for fundamental developments on actor-level vectorization for signal processing dataflow graphs). Since M represents the number of bits for each symbol, M = 2, 4 correspond, for example, to QPSK, QAM16, respectively.…”

Section: Application Examplementioning

confidence: 99%

Parameterized Sets of Dataflow Modes And Their Application to Implementation of Cognitive Radio Systems

Lin

Wang

Vosoughi

et al. 2014

J Sign Process Syst

View full text Add to dashboard Cite

Cognitive radio networks present challenges at many levels of design, including configuration, control, and cross-layer optimization. To meet requirements of bandwidth, flexibility and reconfigurability, systematic methods to model and analyze cognitive radio designs on signal processing platforms are desired. To help address these challenges, we present in this paper a novel dataflow modeling technique, called parameterized set of modes (PSM). PSMs allow efficient representation, manipulation and application of related groups of processing configurations for functional design components in signal processing systems. PSMs lead to more concise formulations of actor behavior, and a unified modeling methodology for applying a variety of techniques for efficient implementation. We develop the formal foundations of PSM-based modeling, and demonstrate its utility through two case studies involving the mapping of reconfigurable wireless communication functionality into efficient implementations.

show abstract

Optimum vectorization of scalable synchronous dataflow graphs

Cited by 75 publications

References 7 publications

The CBP Parameter: A Module Characterization Approach for DSP Software Optimization

The CBP Parameter: A Module Characterization Approach for DSP Software Optimization

Systematic consolidation of input and output buffers in synchronous dataflow specifications

Parameterized Sets of Dataflow Modes And Their Application to Implementation of Cognitive Radio Systems

Contact Info

Product

Resources

About