Probabilistic State-Based RT-Analysis of SDFGs on MPSoCs with Shared Memory Communication
| Autor: | Henning Schlender, Ralf Stemmer, Wolfgang Nebel, Maher Fakih, Kim Grüttner |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
010302 applied physics
Dataflow Computer science Probabilistic logic Static timing analysis 02 engineering and technology Parallel computing Video processing MPSoC 01 natural sciences Execution time 020202 computer hardware & architecture Automaton Shared memory 0103 physical sciences 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) |
| Zdroj: | DATE |
| DOI: | 10.23919/date.2019.8715052 |
| Popis: | This paper extends a state-based timing analysis for Synchronous Dataflow Applications on an MPSoC with shared memory. The existing approach transforms a mapped and timing annotated SDF graph into a timed automata representation for the analysis of timing properties. One major drawback of the existing timing annotation approach is the usage of best- and worst-case execution time intervals, resulting in an overestimation of the actual timing behavior. This paper proposes to replace the timing bound annotation with a probability density function. For the overall timing analysis we use a stochastic timed automata model.We demonstrate and evaluate our approach on a Sobel filter, which is used in many image and video processing algorithms. As a reference, we compare our stochastic execution time model against a fixed best-/worst-case execution time model and against the measured execution time on an FPGA prototype.The results are promising and clearly indicate that our probabilistic approach provides tighter timing analysis results in comparison to the best-/worst-case execution analysis model. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|