Practical and Accurate Throughput Analysis with the Cyclo Static Dataflow Model
Practical and Accurate Throughput Analysis with the Cyclo Static Dataflow Model
复制标题
DOI：
10.1109/mascots.2007.52
复制
发表时间：
2007-10
期刊：
影响因子：
--
通讯作者：
A. Moonen;M. Bekooij;René van den Berg;J. V. Meerbergen
中科院分区：
文献类型：
--
作者：
A. Moonen;M. Bekooij;René van den Berg;J. V. Meerbergen
嵌入式媒体应用程序具有实时约束，例如吞吐量和延迟。在本文中，我们表明，一个严格的约束上的最小吞吐量可以计算与一个循环静态的Crocklow模型，代表的应用程序上执行的多处理器片上系统。我们确定了影响计算界限紧密度的来源。不准确性的一个来源是，出于效率原因，我们没有实现参与者的触发规则。我们将表明，这是允许一个静态的顺序任务调度和计算的界限是一个保守的估计，实际的最小吞吐量。对于我们的案例研究，计算的吞吐量界限比周期精确模拟测量的吞吐量低10.1%。
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.