End-to-end probability analysis method for multi-core distributed systems

Abstract

Timing determinism in embedded real-time systems requires meeting timing constraints not only for individual tasks but also for chains of tasks that involve multiple messages. End-to-end analysis is a commonly used approach for solving such problems. However, the temporal properties of tasks often have uncertainty, which makes end-to-end analysis challenging and prone to errors. In this paper, we focus on enhancing the precision and safety of end-to-end timing analysis by introducing a novel probabilistic method. Our approach involves establishing a probabilistic model for end-to-end timing analysis and implementing two algorithms: the maximum data age detection algorithm and the end-to-end timing deadline miss probability detection algorithm. The experimental results indicate that our approach surpasses traditional analytical methods in terms of safety and significantly enhances the capability to detect the probability of missing end-to-end deadlines.