Computer Organization and Design: The Hardware/Software Interface

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

View Full Document Right Arrow Icon
CS152 Spring ‘03 Midterm II Page 1 University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Midterm II May 7 th , 2003 CS152 Computer Architecture and Engineering Your Name: SID Number: Discussion Section: Problem Possible Score 1 20 2 25 3 30 4 25 Total
Background image of page 1

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

View Full DocumentRight Arrow Icon
CS152 Spring ‘03 Midterm II Page 2 [ This page left for π ] 3.141592653589793238462643383279502884197169399375105820974944
Background image of page 2
CS152 Spring ‘03 Midterm II Page 3 Problem 1: Short Answers Problem 1a[2pts]: Give a simple definition of precise interrupts/exceptions. Why is this important? Problem 1b[3pts]: Explain why exceptions can occur out of order (in time) in an in-order, 5- stage pipeline. Give an example and explain how to achieve a precise exception point anyway. Problem 1c[3pts]: Name and define 3 types of pipeline data hazards. For each hazard, explain how it is prevented in the 5-stage 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
CS152 Spring ‘03 Midterm II Page 4 Problem 1d[2pts]: How do you refresh a DRAM, and why does this work (i.e. what is happening internally)? Problem 1e[2pts]: What are load-delay slots? Does the programmer need to know about them (explain carefully): Problem 1f[2pts]: Why is it important for Tomasulo to issue instructions in-order?
Background image of page 4
CS152 Spring ‘03 Midterm II Page 5 Problem 1g[2pts]: What is a victim cache? What is it good for? Problem 1h[2pts]: Name and describe the structure that permits an out-of-order processor to achieve precise interrupts. How does this work? Problem 1i[2pts]: Suppose you have a processor with a 4K page size, 16K first-level data cache with 128-bit cache lines. Assume that you want to overlap TLB lookup with cache lookup. What is the required associativity of the first-level cache?
Background image of page 5

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

View Full DocumentRight Arrow Icon
CS152 Spring ‘03 Midterm II Page 6 [This page intentionally left blank]
Background image of page 6
CS152 Spring ‘03 Midterm II Page 7 Problem 2: Memory Hierarchy Problem 2a[2pts]: Assume that we have a byte-addressed 64-bit processor with 64-bit words. Suppose that this processor has a 48-word, three-way, set-associative cache (LRU replacement) with 2-word cache lines. Split the 64-bit address into “tag”, “index”, and “cache-line offset” pieces. Which address bits comprise each piece (one is given)? tag: index: cache-line offset: bits 3 – 0 Problem 2b[2pts]: How many sets does this cache have? Explain. Problem 2c[7pts]: Assume that the processor makes the following byte accesses. Label each reference address as a Hit (H) or a Miss (M). Also, identify each cache miss as a compulsory, conflict, or capacity miss. Byte Address
Background image of page 7

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

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This homework help was uploaded on 01/29/2008 for the course CS 152 taught by Professor Kubiatowicz during the Spring '04 term at University of California, Berkeley.

Page1 / 17

Sp03 midterm2 - CS152 Spring `03 Midterm II Page 1...

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

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