Systematic consolidation of input and output buffers in synchronous dataflow specifications

Murthy, Praveen K.; Bhattacharyya, Shuvra S.

doi:10.1109/sips.2000.886765

Cited by 5 publications

(11 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since we can perform this characterization in the context of a restricted subset of dataflow that is not Turing complete, our technique is feasible, practical, and efficient. SDF compilers that make use of the CBP parameter effectively are presented elsewhere [15,16]; we do not address those techniques in this paper. Here, we focus on techniques for determining the CBP parameter.…”

Section: Problem Statement and Organization Of The Papermentioning

confidence: 99%

“…Moreover, the compiler can still make use of these enhanced overlaying opportunities through polynomialtime algorithms such as our buffer merging algorithms [16], and our hybrid algorithms that combine CBPbased buffer merging with lifetime-analysis techniques [15].…”

Section: Related Workmentioning

confidence: 99%

“…However, we will show that the CBP parameter concisely and precisely captures key properties pertaining to the relative times at which tokens are produced and consumed by an 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. In this paper, we do not address the types of optimizations an SDF compiler can perform using the CBP parameter; these optimizations are presented elsewhere [15,16]. Instead, we concentrate on techniques for computing the CBP parameter for several commonly used DSP actors.…”

Section: Prod(e)q[src(e)] = Cons(e)q[snk(e)]mentioning

confidence: 99%

“…The algorithm stops when there is no further improvement. Further details on this algorithm are developed in [15].…”

Section: Buffer Mergingmentioning

confidence: 99%

“…We observe that a significant proportion of the actors examined in Table 3 admit a CBP efficiency of 100%, while the CBP efficiencies of other actors can be significantly lower and heavily parameter-dependent. To illustrate the practical impact of CBP-based analysis, we provide in Table 4 the overall buffer memory requirements from our hybrid SDF compiler that combines CBP-based buffer merging and lifetime analysis techniques for several practical systems specified as SDF graphs [15]. The systems tested here include a QMF filter bank [33], an FFT-based spectral analysis system [32], a satellite receiver [2], a CD to DAT sample-rate converter, and a phased-array system [32].…”

Section: Summary Of Derivationsmentioning

confidence: 99%

See 4 more Smart Citations

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: Problem Statement and Organization Of The Papermentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Prod(e)q[src(e)] = Cons(e)q[snk(e)]mentioning

confidence: 99%

“…The algorithm stops when there is no further improvement. Further details on this algorithm are developed in [15].…”

Section: Buffer Mergingmentioning

confidence: 99%

Section: Summary Of Derivationsmentioning

confidence: 99%

See 3 more Smart Citations

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

Shared buffer implementations of signal processing systems using lifetime analysis techniques

Murthy¹,

Bhattacharyya

2001

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

Self Cite

View full text Add to dashboard Cite

Abstract-There has been a proliferation of block-diagram environments for specifying and prototyping digital signal processing (DSP) systems. These include tools from academia such as Ptolemy and commercial tools such as DSPCanvas from Angeles Design Systems, signal processing work system (SPW) from Cadence, and COSSAP from Synopsys. The block diagram languages used in these environments are usually based on dataflow semantics because various subsets of dataflow have proven to be good matches for expressing and modeling signal processing systems. In particular, synchronous dataflow (SDF) has been found to be a particularly good match for expressing multirate signal processing systems. One of the key problems that arises during synthesis from an SDF specification is scheduling. Past work on scheduling from SDF has focused on optimization of program memory and buffer memory under a model that did not exploit sharing opportunities. In this paper, we build on our previously developed analysis and optimization framework for looped schedules to formally tackle the problem of generating optimally compact schedules for SDF graphs. We develop techniques for computing these optimally compact schedules in a manner that also attempt to minimize buffering memory under the assumption that buffers will be shared. This results in schedules whose data memory usage is drastically lower than methods in the past have achieved. The method we use is that of lifetime analysis; we develop a model for buffer lifetimes in SDF graphs and develop scheduling algorithms that attempt to generate schedules that minimize the maximum number of live tokens under the particular buffer lifetime model. We develop several efficient algorithms for extracting the relevant lifetimes from the SDF schedule. We then use the well-known firstfit heuristic for packing arrays efficiently into memory. We report extensive experimental results on applying these techniques to several practical SDF systems and show improvements that average 50% over previous techniques, with some systems exhibiting up to an 83% improvement over previous techniques.

show abstract

Buffer sharing in CSP-like programs

Vasudevan¹,

Edwards²

2009

2009 7th IEEE/ACM International Conference on Formal Methods and Models for Co-Design

View full text Add to dashboard Cite

show abstract

Systematic consolidation of input and output buffers in synchronous dataflow specifications

Cited by 5 publications

References 17 publications

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

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

Shared buffer implementations of signal processing systems using lifetime analysis techniques

Buffer sharing in CSP-like programs

Contact Info

Product

Resources

About