Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication


Share/Save/Bookmark

Wiggers, Maarten H. and Bekooij, Marco J.G. and Smit, Gerard J.M. (2008) Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication. In: 14th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS, 22-24 April 2008, St. Louis, MO, United States.

[img]
Preview
PDF
235Kb
Abstract:Streaming applications are often implemented as task graphs, in which data is communicated from task to task over buffers. Currently, techniques exist to compute buffer capacities that guarantee satisfaction of the throughput constraint if the amount of data produced and consumed by the tasks is known at design-time. However, applications such as audio and video decoders have tasks that produce and consume an amount of data that depends on the decoded stream. This paper introduces a dataflow model that allows for data-dependent communication, together with an algorithm that computes buffer capacities that guarantee satisfaction of a throughput constraint. The applicability of this algorithm is demonstrated by computing buffer capacities for an H.263 video decoder.
Item Type:Conference or Workshop Item
Copyright:© 2008 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64842
Official URL:http://dx.doi.org/10.1109/RTAS.2008.10
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 251042