Lecture 9: R10K scheme, T clk. EECS 470 Fall 2014. Crazy (still). HW3 is due on Wednesday 2/12 It’s a fair bit of work (3 hours?) You’ll probably have questions ! Should be able to do all but #3 now. This lecture will cover #3 Midterm is on Monday 2/17, 6-8pm Room assignments TBA
D: Branch (R1==0)
Note: the literature usually calls this “map table checkpoints” or some such. I find that unwieldy so BRAT or BMAP will
be used here. See “Checkpoint Processing and Recovery: Towards Scalable Large Instruction Window Processors” for
a nice overview of options on branch misprediction recovery.