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

Abstract - Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constraint for task graphs in which the inter-task communication is data-independent, i.e. the amount of data produced and consumed is independent of the data values in the processed stream. This paper presents a technique to compute buffer capacities that satisfy a throughput constraint for task graphs with data dependent inter-task communication, given that the task graph is a chain. We demonstrate the applicability of the approach by computing buffer capacities for an MP3 playback application, of which the MP3 decoder has a variable consumption rate. We are not aware of alternative approaches to compute buffer capacities that guarantee satisfaction of the throughput constraint for this application.

• Type: Conference
• Year: 2008
• Where: DATE
• Authors: Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
• Keywords: Buffer Capacities, DATE 2008, Hardware, Task Graph, Throughput Constraint