ECS 201A Midterm: ECS201A Midterm 2 Winter 2012
9 Jan 2019
School
Department
Course
Professor
Document Summary
How many bits? (7) (3) list 3 examples of existing dynamic branch prediction strategies in order of (average) increasing effectiveness. (8) (3) the book lists several things that limit the amount of achievable ilp. What hard- ware feature makes tomasulo"s work? (11) (6) understanding the hardware can in uence how you write programs. Why is there a desire to create larger ones? (14) (6) there are at least two types of control ow changes that standard dynamic branch predictors have trouble with. Brie y explain why, and give three different techniques that can be used to provide precise inter- rupts. What is the difference between coarse mt, ne mt, and smt? (17) (6) forwarding is often used to overcome raw data hazards. If not, why not? (18) (6) compare and contrast superscalar and vliw. Describe each, and list two advantages and disad- vantages of each approach.
