Latest revision as of 21:03, 3 February 2021

Abstract

International audience; Long pipelines need good branch predictors to keep the pipeline running. Current branch predictors are optimized for the average case, which might not be a good fit for real-time systems and worst- case execution time analysis.This paper presents a time-predictable branch predictor co-designed with the associated worst-case execution time analysis. The branch predictor uses a fully-associative cache to track branch outcomes and destination addresses. The fully-associative cache avoids any false sharing of entries between branches. Therefore, we can analyze program scopes that contain a number of branches lower than or equal to the number of branches in the prediction table. Experimental results show that the worst-case execution time bounds of programs using the proposed predictor are lower than using static branch predictors at a moderate hardware cost.

Original document

The different versions of the original document can be found in:

• https://backend.orbit.dtu.dk/ws/files/199918067/branchpred.pdf

• http://dl.acm.org/ft_gateway.cfm?id=3297337&ftid=2053206&dwn=1,

http://dx.doi.org/10.1145/3297280.3297337 under the license http://www.acm.org/publications/policies/copyright_policy#Background

• https://dblp.uni-trier.de/db/conf/sac/sac2019.html#SchoeberlRP19,

https://hal.inria.fr/hal-01976187/document,

https://hal.inria.fr/hal-01976187,

https://dl.acm.org/citation.cfm?id=3297337,

https://academic.microsoft.com/#/detail/2937585328

• https://hal.inria.fr/hal-01976187,

https://hal.inria.fr/hal-01976187/document,

https://hal.inria.fr/hal-01976187/file/branchpred.pdf

• https://orbit.dtu.dk/en/publications/d3283cc3-fecb-4df4-9bed-a351ee7112d8,

https://doi.org/10.1145/3297280.3297337,

https://backend.orbit.dtu.dk/ws/files/199918067/branchpred.pdf