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:

http://dx.doi.org/10.1145/3297280.3297337 under the license http://www.acm.org/publications/policies/copyright_policy#Background
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/document,
https://hal.inria.fr/hal-01976187/file/branchpred.pdf
https://doi.org/10.1145/3297280.3297337,
https://backend.orbit.dtu.dk/ws/files/199918067/branchpred.pdf
Back to Top

Document information

Published on 01/01/2019

Volume 2019, 2019
DOI: 10.1145/3297280.3297337
Licence: Other

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?