Buffer Capacity Computation for Throughput-Constrained Modal Task Graphs

Share/Save/Bookmark

Wiggers, Maarten H. and Bekooij, Marco J.G. and Smit, Gerard J.M. (2010) Buffer Capacity Computation for Throughput-Constrained Modal Task Graphs. ACM Transactions on Embedded Computing Systems, 10 (2). p. 17. ISSN 1539-9087

[img] PDF
Restricted to UT campus only
: Request a copy
1MB
Abstract:Increasingly, stream-processing applications include complex control structures to better adapt to changing conditions in their environment. This adaptivity often results in task execution rates that are dependent on the processed stream. Current approaches to compute buffer capacities that are sufficient to satisfy a throughput constraint have limited applicability in case of data-dependent task execution rates.

In this article, we present a dataflow model that allows tasks to have loops with an unbounded number of iterations. For instances of this dataflow model, we present efficient checks on their validity. Furthermore, we present an efficient algorithm to compute buffer capacities that are sufficient to satisfy a throughput constraint.

This allows to guarantee satisfaction of a throughput constraint over different modes of a stream processing application, such as the synchronization and synchronized modes of a digital radio receiver.
Item Type:Article
Copyright:© 2010 ACM
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/75309
Official URL:http://dx.doi.org/10.1145/1880050.1880053
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page