NDLI: A new case for the TAGE branch predictor

Please wait, while we are loading the content...

Active management of timing guardband to save energy in POWER7

Towards the ideal on-chip fabric for 1-to-many and many-to-1 communication

A new case for the TAGE branch predictor

QsCores: trading dark silicon for scalable energy efficiency with quasi-specific cores

ATDetector: improving the accuracy of a commercial data race detector by identifying address transfer

Bubble-Up: increasing utilization in modern warehouse scale computers via sensible co-locations

Complementing user-level coarse-grain parallelism with implicit speculative parallelism

Pay-As-You-Go: low-overhead hard-error correction for phase change memories

A register-file approach for row buffer caches in die-stacked DRAMs

Accelerating microprocessor silicon validation by exposing ISA diversity

Residue cache: a low-energy low-area L2 cache architecture via compression and partial hits

A compile-time managed multi-level register file hierarchy

Bundled execution of recurring traces for energy-efficient general purpose processing

A systematic methodology to develop resilient cache coherence protocols

Packet chaining: efficient single-cycle allocation for on-chip networks

Identifying and predicting timing-critical instructions to boost timing speculation

Pack & Cap: adaptive DVFS and thread packing under power caps

CoreRacer: a practical memory race recorder for multicore x86 TSO processors

System-level integrated server architectures for scale-out datacenters

Hardware transactional memory for GPU architectures

Multi retention level STT-RAM cache designs with a dynamic refresh scheme

Parallel application memory scheduling

Encore: low-cost, fine-grained transient fault recovery

SHiP: signature-based hit predictor for high performance caching

SIMD re-convergence at thread frontiers

Minimalist open-page: a DRAM page-mode scheduling policy for the many-core era

Dataflow execution of sequential imperative programs on multicore architectures

Resilient microring resonator based photonic networks

Idempotent processor architecture

Preventing PCM banks from seizing too much power

Manager-client pairing: a framework for implementing coherence hierarchies

Architectural support for secure virtualization under a vulnerable hypervisor

Improving GPU performance via large warps and two-level warp scheduling

A resistive TCAM accelerator for data-intensive computing

Reducing memory interference in multicore systems via application-aware memory channel partitioning

Formally enhanced runtime verification to ensure NoC functional correctness

PACMan: prefetch-aware cache management for high performance caching

A data layout optimization framework for NUCA-based multicores

FeatherWeight: low-cost optical arbitration with QoS support

Proactive instruction fetch

CRAM: coded registers for amplified multiporting

TransCom: transforming stream communication for load balance and efficiency in networks-on-chip

Efficiently enabling conventional block sizes for very large die-stacked DRAM caches

A new case for the TAGE branch predictor

Content Provider	ACM Digital Library
Author	Seznec, André
Abstract	The TAGE predictor is often considered as state-of-the-art in conditional branch predictors proposed by academy. In this paper, we first present directions to reduce the hardware implementation cost of TAGE. Second we show how to further reduce the misprediction rate of TAGE through augmenting it with small side predictors. On a hardware implementation of a conditional branch predictor, the predictor tables are updated at retire time. A retired branch normally induces three accesses to the branch predictor tables: read at prediction time, read at retire time and write for the update. We show that in practice, the TAGE predictor accuracy would not be significantly impaired by avoiding a systematic second read of the prediction tables at retire time for correct prediction. Combined with the elimination of silent updates, this significantly reduces the number of accesses to the predictor. Furthermore, we present a technique allowing to implement the TAGE predictor tables as bank-interleaved structures using single-port memory components. This significantly reduces the silicon footprint of the predictor as well as its energy consumption without significantly impairing its accuracy. In the last few years, progress in branch prediction accuracy has relied on associating a main state-of-the-art single scheme branch predictor with specialized side predictors. As a second contribution of the paper, we develop this side predictor approach for TAGE. At the recent 3rd Championship Branch Prediction, it was shown that the TAGE predictor can be augmented with several side predictors, each one addressing a category of predictions that is not optimally addressed by TAGE. The Immediate Update Mimicker tracks the inflight already executed but not retired branches and use their result for correcting the predictions. Sometimes TAGE fails to predict when the control flow path inside the loop body is irregular. TAGE can be augmented with a loop predictor to predict loops with constant iteration numbers, TAGE also sometimes fails to predict branches that are not strongly biased but that are only statistically biased. The Statistical Corrector Predictor is introduced to track these statistically correlated branches. These side predictors allow to increase the prediction accuracy of TAGE. Building on top of these proposals, we further show that the Statistical Corrector Predictor can be used to leverage local history to further improve the potential of the TAGE predictor. Furthermore, we show that the use of a Statistical Corrector predictor based on local history, LSC, dwarfs the benefits of the loop predictor and the global history Statistical Corrector. Finally, we present a cost-effective implementation of the TAGE-LSC predictor using single-port memory components and a reduced number of accesses per prediction.
Starting Page	117
Ending Page	127
Page Count	11
File Format	PDF
ISBN	9781450310536
DOI	10.1145/2155620.2155635
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2011-12-03
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in