loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 IEEE Real-Time and Embedded Technology and Applications Symposium
Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication
April 22-April 24
ISBN: 978-0-7695-3146-5
ASCII Text
x 
 
Maarten H. Wiggers, Marco J.G. Bekooij, Gerard J.M. Smit, "Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication," Real-Time and Embedded Technology and Applications Symposium, IEEE, pp. 183-194, 2008 IEEE Real-Time and Embedded Technology and Applications Symposium, 2008.
 
 
BibTex
x
 
@article{ 10.1109/RTAS.2008.10,
author = {Maarten H. Wiggers and Marco J.G. Bekooij and Gerard J.M. Smit},
title = {Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication},
journal ={Real-Time and Embedded Technology and Applications Symposium, IEEE},
volume = {0},
year = {2008},
issn = {1080-1812},
pages = {183-194},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTAS.2008.10},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time and Embedded Technology and Applications Symposium, IEEE
TI - Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication
SN - 1080-1812
SP183
EP194
A1 - Maarten H. Wiggers,
A1 - Marco J.G. Bekooij,
A1 - Gerard J.M. Smit,
PY - 2008
KW - variable rate dataflow
KW - buffer capacity computation
VL - 0
JA - Real-Time and Embedded Technology and Applications Symposium, IEEE
ER -
 
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.
Index Terms:
variable rate dataflow, buffer capacity computation
Citation:
Maarten H. Wiggers, Marco J.G. Bekooij, Gerard J.M. Smit, "Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication," rtas, pp.183-194, 2008 IEEE Real-Time and Embedded Technology and Applications Symposium, 2008
Usage of this product signifies your acceptance of the Terms of Use.