Skip to content
STIMSMITH

Branch History Table

Concept

A Branch History Table (BHT) is a component of a processor branch predictor that records prior branch outcomes and uses them to predict whether current branch instructions will be taken or not taken. In the cited RISC-V superscalar processor instruction-fetch unit, the BHT is part of the dynamic predictor and uses a GShare indexing scheme; one verified implementation has 256 BHT entries.

First seen 5/28/2026
Last seen 5/28/2026
Evidence 2 chunks
Wiki v1

WIKI

Overview

A Branch History Table (BHT) is a branch-prediction structure used to maintain a history of the outcomes of previous occurrences of each branch. The stored history is used to predict the direction of a current branch instruction, i.e. whether it will be taken or not taken. In the cited RISC-V superscalar processor, the BHT uses a GShare indexing scheme. [citation: BHT purpose and indexing]

Role in instruction fetch

READ FULL ARTICLE →

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

2 connections
Instruction Fetch Unit part of → 98% 1e
The BHT is a component of the dynamic predictor in the instruction fetch unit.
branch predictor part of → 95% 1e
The BHT is a component of the branch predictor.

CITATIONS

6 sources