f99-quiz1

Computer Architecture: A Quantitative Approach, 4th Edition

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
1 University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Midterm I October 13, 1999 CS252 Graduate Computer Architecture Your Name: SID Number: Discussion Section: Problem Possible Score 12 0 22 0 33 5 42 5 Total 100
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 [ This page left for π ] 3.141592653589793238462643383279502884197169399375105820974944
Background image of page 2
3 Question #1: Short Answer 1a) Give a simple definition of precise interrupts/exceptions: 1b) Explain how the presence of delayed branches complicates the description of a precise exception point (think about information that the operating system needs to continue execution after an exception)? 1c) The Alpha 21064 (first version of the Alpha processor) supported precise exceptions for virtual memory but not for floating point operations. What sort of argument might be used to justify this complicated combination of behaviors? 1d) Explain the relationship between support for precise exceptions and support for branch prediction. What hardware structure supports both of these mechanisms in a modern out-of- order pipeline?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 [ This page intentionally left blank!]
Background image of page 4
5 1e) When is it better to handle events via interrupts rather than polling? How about the reverse? Be specific. 1f) Name 3 different things that people try to predict in modern processors: 1g) Why is branch prediction desirable? 1h) Draw a simple diagram for each of the following branch predictors: GAg, PAg, PAp 1i) Explain the difference between implicit and explicit register renaming as defined in class:
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 Problem #2: Superpipelining Suppose that we have single-issue, in-order pipeline with one fetch stage, one decode stage, multiple execution stages (which include memory access) and a singe write-back stage. Assume that it has the following execution latencies (i.e. the number of stages that it takes to compute a value): multf (5 cycles), addf (3 cycles), divf (2 cycles), integer ops (1 cycle). Assume full bypassing and two cycles to perform memory accesses, i.e. loads and stores take a total of 3 cycles to execute (with address computation). Finally, branch conditions are computed by the integer execution unit. .
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 15

f99-quiz1 - University of California, Berkeley College of...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online