Subject

    Computer Science

    Topic

    Computer Hardware

    Which branch handling reduces misprediction penalties without predicting outcomes?

    ক)
    Delayed branching / annul slots
    খ)
    Two-level adaptive predictor
    গ)
    Gshare predictor
    ঘ)
    Perceptron predictor

    Explanation

    Architectures like early MIPS used branch delay slots so one instruction after the branch always executes. Compilers fill the slot to hide control hazards. Predictors guess direction/target; delay slots sidestep some penalties but complicate pipelines. Modern CPUs favor dynamic prediction.

    Find Tutors

    View all Tutors