Practical and Accurate Throughput Analysis with the Cyclo Static Dataflow Model
Ajm Arno Moonen, M. Bekooij, R. van den Berg, Jef van Meerbergen · 2007
Embedded media applications have real-time constraints such as throughput and latency. In this paper we show that a tight bound on the minimum throughput can be computed with a cyclo static dataflow model that represents the application executed on the multiprocessor system-on-chip. We identify the sources that affect the tightness of the computed bound. One source of inaccuracy is that we do not implement, for efficiency reasons, the firing rule of an actor. We will show that this is allowed for a static order task schedule and that the computed bound is a conservative estimate of the actual minimum throughput. For our case study the computed throughput bound is 10.1% lower than the throughput measured with cycle accurate simulation.