Latency Analysis of Homogeneous Synchronous Dataflow Graphs Using Timed Automata
Guus Kuiper1,a and Marco J.G. Bekooij1,2,b
1University of Twente, Enschede, The Netherlands.
ag.kuiper@utwente.nl
bmarco.bekooij@nxp.com
2NXP Semiconductors, Eindhoven, The Netherlands
ABSTRACT
There are several analysis models and corresponding temporal analysis techniques for checking whether applications executed on multiprocessor systems meet their real-time constraints. However, currently there does not exist an exact end-to-end latency analysis technique for Homogeneous Synchronous Dataflow with auto-concurrency (HSDFa) models that takes the correlation between the firing durations of different firings into account.
In this paper we present a transformation of strongly connected HSDFa models into timed automata models. This enables an exact end-to-end latency analysis because the correlation between the firing durations of different firings is taken into account.
In a case study we compare the latency obtained using timed automata and a Linear Program (LP) based analysis technique that relies on a deterministic abstraction and compare their run-times as well. Exact end-to-end latency analysis results are obtained using timed automata, whereas this is not possible using deterministic timed-dataflow models.
