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


Share/Save/Bookmark

Wiggers, Maarten H. and Bekooij, Marco J.G. and Smit, Gerard J.M. (2008) Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication. In: Design Automation and Test in Europe, 10-14 March 2008, Munich, Germany.

[img]
Preview
PDF
440Kb
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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64751
Official URL:http://dx.doi.org/10.1109/DATE.2008.4484749
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 250972