An Approximate Method for Throughput Evaluation of Cyclo-static Dataflow Programs

Because of the multiplication of multi-core architecture, dataflow programming languages regained interest during the last years. In the case of massively multi-core embedded system architectures, the computation of throughput is used for buffer sizing under time constraints. This paper introduces an approximate method for the throughput evaluation for cyclostatic dataflow graphs.