Skip to Main content Skip to Navigation

Many-Core Timing Analysis of Real-Time Systems

Abstract : Predictability is of paramount importance in real-time and safety-critical systems, where non-functional properties --such as the timing behavior -- have high impact on the system's correctness. As many safety-critical systems have agrowing performance demand, classical architectures, such as single-cores, are not sufficient anymore. One increasinglypopular solution is the use of multi-core systems, even in the real-time domain. Recent many-core architectures, such asthe Kalray MPPA, were designed to take advantage of the performance benefits of a multi-core architecture whileoffering certain predictability. It is still hard, however, to predict the execution time due to interferences on sharedresources (e.g., bus, memory, etc.).To tackle this challenge, Time Division Multiple Access (TDMA) buses are often advocated. In the first part of thisthesis, we are interested in the timing analysis of accesses to shared resources in such environments. Our approach usesSatisfiability Modulo Theory (SMT) to encode the semantics and the execution time of the analyzed program. To estimatethe delays of shared resource accesses, we propose an SMT model of a shared TDMA bus. An SMT-solver is used to find asolution that corresponds to the execution path with the maximal execution time. Using examples, we show how theworst-case execution time estimation is enhanced by combining the semantics and the shared bus analysis in SMT.In the second part, we introduce a response time analysis technique for Synchronous Data Flow programs. These are mappedto multiple parallel dependent tasks running on a compute cluster of the Kalray MPPA-256 many-core processor. Theanalysis we devise computes a set of response times and release dates that respect the constraints in the taskdependency graph. We derive a mathematical model of the multi-level bus arbitration policy used by the MPPA. Further,we refine the analysis to account for (i) release dates and response times of co-runners, (ii)task execution models, (iii) use of memory banks, (iv) memory accesses pipelining. Furtherimprovements to the precision of the analysis were achieved by considering only accesses that block the emitting core inthe interference analysis. Our experimental evaluation focuses on randomly generated benchmarks and an avionics casestudy.
Document type :
Complete list of metadata

Cited literature [143 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Thursday, September 27, 2018 - 2:27:07 PM
Last modification on : Friday, March 25, 2022 - 9:43:27 AM
Long-term archiving on: : Friday, December 28, 2018 - 1:21:07 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01875711, version 1



Hamza Rihani. Many-Core Timing Analysis of Real-Time Systems. Performance [cs.PF]. Université Grenoble Alpes, 2017. English. ⟨NNT : 2017GREAM074⟩. ⟨tel-01875711⟩



Record views


Files downloads