EEMCS EPrints Service
de Groote, E. and Hölzenspies, P.K.F. and Kuper, J. and Broersma, H.J. (2013) Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs. In: Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013, 18-20 Oct 2013, Portland, OR, USA. pp. 35-46. IEEE Computer Society. ISBN 978-1-4799-0903-2
Full text available as:
Exact temporal analyses of multi-rate synchronous dataflow (MRSDF) graphs, such as computing the maximum achievable throughput, or sufficient buffer sizes required to reach a minimum throughput, require a homogeneous representation called a homogeneous synchronous dataflow (HSDF) graph. The size of such an HSDF graph may, in the worst case, be exponential in the size of the MRSDF graph. In this paper, we revisit the transformation from MRSDF to HSDF, and show how this transformation may be done either exactly or approximately. The approximate transformation gives both an optimistic and a pessimistic HSDF graph, each of which has the same size as the MRSDF graph. We furthermore show how strict lower and upper bounds on throughput, or on the buffer sizes required to reach a minimum throughput, may be obtained from these approximating graphs.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item