de Groote, E. and Hölzenspies, P.K.F. and Kuper, J. and Smit, G.J.M.
Single-rate approximations of cyclo-static synchronous dataflow graphs.
In: Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems (SCOPES 2014), 10-11 Jun 2014, St. Goar, Germany.
Full text available as:
PDF - Univ. of Twente only
Official URL: http://dx.doi.org/10.1145/2609248.2609249
Exact analysis of synchronous dataflow (sdf) graphs is often considered too costly, because of the expensive transformation of the graph into a single-rate equivalent. As an alternative, several authors have proposed approximate analyses. Existing approaches to approximation are based on the operational semantics of an sdf graph.
We propose an approach to approximation that is based on functional semantics. This generalises earlier work done on multi-rate sdf graphs towards cyclo-static sdf (csdf) graphs. We take, as a starting point, a mathematical characterisation, and derive two transformations of a csdf graph into hsdf graphs. These hsdf graphs have the same size as the csdf graph, and are approximations: their respective temporal behaviours are optimistic and pessimistic with respect to the temporal behaviour of the csdf graph. Analysis results computed for these single-rate approximations give bounds on the analysis results of the csdf graph. As an illustration, we show how these single-rate approximations may be used to compute bounds on the buffer sizes required to reach a given throughput.
|Item Type:||Conference or Workshop Paper (Full Paper, Talk)|
|Research Group:||EWI-CAES: Computer Architecture for Embedded Systems|
|Research Program:||CTIT-DSN: Dependable Systems and Networks|
|Research Project:||POLCA: Programming Large Scale Heterogeneous Infrastructures, SENSATION: Self Energy-supporting Autonomous Computation|
|Deposited On:||30 June 2014|
Export this item as:
To request a copy of the PDF please email us request copy
To correct this item please ask your editor
Repository Staff Only: edit this item