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

Authors:
Maarten H. Wiggers;Marco J. G. Bekooij;Pierre G. Jansen;Gerard J. M. Smit
Affiliations:
University of Twente, The Netherlands;NXP Semiconductors, The Netherlands;University of Twente, The Netherlands;University of Twente, The Netherlands
Venue:
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Year:
2007

Citing 0
Cited 11

Efficient buffer capacity and scheduler setting computation for soft real-time stream processing applications

SCOPES '07 Proceedingsof the 10th international workshop on Software & compilers for embedded systems
Modelling run-time arbitration by latency-rate servers in dataflow graphs

SCOPES '07 Proceedingsof the 10th international workshop on Software & compilers for embedded systems
Communication between nested loop programs via circular buffers in an embedded multiprocessor system

SCOPES '08 Proceedings of the 11th international workshop on Software & compilers for embedded systems
Computation of buffer capacities for throughput constrained and data dependent inter-task communication

Proceedings of the conference on Design, automation and test in Europe
CoMPSoC: A template for composable and predictable multi-processor system on chips

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Inter-task communication via overlapping read and write windows for deadlock-free execution of cyclic task graphs

SAMOS'09 Proceedings of the 9th international conference on Systems, architectures, modeling and simulation
Programming MPSoC platforms: road works ahead!

Proceedings of the Conference on Design, Automation and Test in Europe
Buffer capacity computation for throughput-constrained modal task graphs

ACM Transactions on Embedded Computing Systems (TECS)
The earlier the better: a theory of timed actor interfaces

Proceedings of the 14th international conference on Hybrid systems: computation and control
Compositional temporal analysis model for incremental hard real-time system design

Proceedings of the tenth ACM international conference on Embedded software
Cyclo-static DataFlow phases scheduling optimization for buffer sizes minimization

Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

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.