Throughput-buffering trade-off exploration for cyclo-static and synchronous dataflow graphs.

Research output: Contribution to journalArticleAcademicpeer-review

101 Citations (Scopus)
4 Downloads (Pure)

Abstract

Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute intensive kernels of these applications are often specified as Cyclo-Static or Synchronous Dataflow Graphs. Communication between nodes in these graphs requires storage space which influences throughput. We present an exact technique to chart the Pareto space of throughput and storage trade-offs, which can be used to determine the minimal buffer space needed to execute a graph under a given throughput constraint. The feasibility of the exact technique is demonstrated with experiments on a set of realistic DSP and multimedia applications. To increase scalability of the approach, a fast approximation technique is developed that guarantees both throughput and a, tight, bound on the maximal overestimation of buffer requirements. The approximation technique allows to trade off worst-case overestimation versus run-time.
Original languageEnglish
Pages (from-to)1331-1345
Number of pages15
JournalIEEE Transactions on Computers
Volume57
Issue number10
DOIs
Publication statusPublished - 2008

Fingerprint

Dive into the research topics of 'Throughput-buffering trade-off exploration for cyclo-static and synchronous dataflow graphs.'. Together they form a unique fingerprint.

Cite this