Location of Repository

Branch Target Buffers: WCET Analysis Framework and Timing Predictability

By Daniel Grund, Jan Reineke and Gernot Gebhard

Abstract

One step in the verification of hard real-time systems is to determine upper bounds on the worstcase execution times (WCET) of tasks. To obtain tight bounds, a WCET analysis has to consider micro-architectural features like caches, branch prediction, and branch target buffers (BTB). We propose a modular WCET analysis framework for branch target buffers, which allows for easy adaptability to different BTBs. As an example, we investigate the Motorola PowerPC 56x family (MPC56x), which is used in automotive and avionic systems. On a set of avionic and compiler benchmarks, our analysis improves WCET bounds on average by 17 % over no BTB analysis. Capitalizing on the modularity of our framework, we explore alternative hardware designs. We propose more predictable designs, which improve obtainable WCET bounds by up to 20%, reduce analysis time considerably, and simplify the analysis. We generalize our findings and give advice concerning hardware used in real-time systems

Topics: Key words, Worst-case Execution-time (WCET) Analysis, Predictability, Branch Target Buffer (BTB
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.169.2925
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://rw4.cs.uni-saarland.de/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.