Skip to Main Content
For real-time systems, in order to provide the basis for schedulability analysis, it is crucial to obtain Worst-Case Execution Time (WCET) of applications, which is very challenging due to the possible runtime inter-thread interferences caused by shared resources in multi-core processors. For multi-core platforms with shared cache, instructions of a thread may be evicted by another co-running thread, which results in the interferences in shared cache. Designers need to consider the interferences while analyzing WCET of threads on multi-core platforms. This paper proposes a novel approach to analyzing the worst-case cache interferences based on instruction fetching timing, while judging the interferences status through instruction fetching timing relations. The paper presents an algorithm for instruction fetching timing based on Depth-First-Search in control flow graph. Our approach can reasonably estimate runtime inter-thread interferences in shared cache by introducing timing relations analysis into address mapping method. Experiments show that our proposed approach improves the tightness of WCET estimation by 19.244% on average.