Global Predictors with N Entries Assume we have the following outcome trace from different branch instructions X and Y: X-T X-N Y-T X-T Y-T X-N X-T Y-T X-N Assume the lowest bit of X Address maps to 0, and the lowest bit of Y maps to 1 ind tne weslcaie eceunto tohal branch histony table . Using 1-bit predictor and initial state is always T . Using 2-bit predictor and initial state is Weakly Taken . Compare the 2-entry scheme with having only 1-entry Global Predictors with N Entries Assume we have the following outcome trace from different branch instructions X and Y: X-T X-N Y-T X-T Y-T X-N X-T Y-T X-N Assume the lowest bit of X Address maps to 0, and the lowest bit of Y maps to 1 ind tne weslcaie eceunto tohal branch histony table . Using 1-bit predictor and initial state is always T . Using 2-bit predictor and initial state is Weakly Taken . Compare the 2-entry scheme with having only 1-entry