Abstract
| Original language | Undefined |
|---|---|
| Title of host publication | Proceedings of the 14th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'08 |
| Place of Publication | Los Alamitos |
| Publisher | IEEE Computer Society |
| Pages | 183-194 |
| Number of pages | 12 |
| ISBN (Print) | 978-0-7695-3146-5 |
| DOIs | |
| Publication status | Published - Apr 2008 |
Publication series
| Name | |
|---|---|
| Publisher | IEEE Computer Society Press |
| Number | 302 |
| ISSN (Print) | 1080-1812 |
Keywords
- IR-64842
- METIS-251042
- EWI-12967
Cite this
}
Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication. / Wiggers, M.H.; Bekooij, Marco J.G.; Bekooij, Marco Jan Gerrit; Smit, Gerardus Johannes Maria.
Proceedings of the 14th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'08. Los Alamitos : IEEE Computer Society, 2008. p. 183-194 10.1109/RTAS.2008.10.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
TY - GEN
T1 - Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication
AU - Wiggers, M.H.
AU - Bekooij, Marco J.G.
AU - Bekooij, Marco Jan Gerrit
AU - Smit, Gerardus Johannes Maria
N1 - 10.1109/RTAS.2008.10
PY - 2008/4
Y1 - 2008/4
N2 - 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.
AB - 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.
KW - IR-64842
KW - METIS-251042
KW - EWI-12967
U2 - 10.1109/RTAS.2008.10
DO - 10.1109/RTAS.2008.10
M3 - Conference contribution
SN - 978-0-7695-3146-5
SP - 183
EP - 194
BT - Proceedings of the 14th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'08
PB - IEEE Computer Society
CY - Los Alamitos
ER -