Title
Probabilistic State-Based Rt-Analysis Of Sdfgs On Mpsocs With Shared Memory Communication
Abstract
This paper extends a state-based timing analysis for Synchronous Ftataflow 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 hest-/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.
Year
DOI
Venue
2019
10.23919/DATE.2019.8715052
2019 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE)
Field
DocType
ISSN
Shared memory,Computer science,Parallel computing,Probabilistic logic
Conference
1530-1591
Citations 
PageRank 
References 
0
0.34
0
Authors
5
Name
Order
Citations
PageRank
Ralf Stemmer100.68
Henning Schlender200.34
Maher Fakih394.98
Kim Grüttner410122.67
Wolfgang Nebel548476.22