Modeling control speculation for timing analysis

  • Authors:
  • Xianfeng Li;Tulika Mitra;Abhik Roychoudhury

  • Affiliations:
  • School of Computing, National University of Singapore, 3 Science Drive 2, Singapore 117543, Singapore;School of Computing, National University of Singapore, 3 Science Drive 2, Singapore 117543, Singapore;School of Computing, National University of Singapore, 3 Science Drive 2, Singapore 117543, Singapore

  • Venue:
  • Real-Time Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The schedulability analysis of real-time embedded systems requires worst case execution time (WCET) analysis for the individual tasks. Bounding WCET involves not only language-level program path analysis, but also modeling the performance impact of complex micro-architectural features present in modern processors. In this paper, we statically analyze the execution time of embedded software on processors with speculative execution. The speculation of conditional branch outcomes (branch prediction) significantly improves a program's execution time. Thus, accurate modeling of control speculation is important for calculating tight WCET estimates. We present a parameterized framework to model the different branch prediction schemes. We further consider the complex interaction between speculative execution and instruction cache performance, that is, the fact that speculatively executed blocks can generate additional cache hits/misses. We extend our modeling to capture this effect of branch prediction on cache performance. Starting with the control flow graph of a program, our technique uses integer linear programming to estimate the program's WCET. The accuracy of our method is demonstrated by tight estimates obtained on realistic benchmarks.