Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure


Share/Save/Bookmark

Wiggers, Maarten H. and Bekooij, Marco J.G. and Jansen, Pierre G. and Smit, Gerard J.M. (2007) Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure. In: 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS, 3-6 April 2007, Seattle, WA, United States (pp. pp. 281-292).

open access
[img]
Preview
PDF
214kB
Abstract:This paper describes a conservative approximation algorithm that derives close to minimal buffer capacities for an application described as a cyclo-static dataflow graph. The resulting buffer capacities satisfy constraints on the maximum buffer capacities and end-to-end throughput and latency constraints. Furthermore we show that the effects of run-time arbitration can be included in the response times of dataflow actors. We show that modelling an MP3 playback application as a cyclo-static dataflow graph instead of a multi-rate dataflow graph results in buffer capacities that are reduced up to 39%. Furthermore, the algorithm is applied to a real-life car-radio application, in which two independent streams are processed.
Item Type:Conference or Workshop Item
Copyright:© 2007 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/67100
Official URL:http://dx.doi.org/10.1109/RTAS.2007.12
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 242168