CSE 410 Computer Systems - Homework 5 - Spring 2009

CSE Home

About Us

Search

Contact Info

Due: Thursday, May 14, at 11 pm.

In this assignment we'll explore some of the issues involving caches.

1. Patterson & Hennessy, 5.3.1. Use the data in table row (a) above the question. Note that the problem assumes a word-addressable memory, where adjacent words have addresses that differ by 1, not a byte-addressable memory where adjacent word addresses differ by 4.
   
   
2. Patterson & Hennessy, 5.3.2. Use the data in table row (a) for this question also. This problem also assumes a word-addressable memory.
   
   
3. Patterson & Hennessy, 5.4.1 and 5.4.2. Use the data in table row (a). In this problem, the memory is byte-addressable, with each word occupying 4 bytes.
   
   
4. Suppose we have a main memory and cache with the following characteristics: main memory access time 70 ns., cache access time 0.8 ns, cache miss ratio 4.5%. What is the effective access time of this memory system?
   

Turn-in Instructions: Use the turn-in drop box link on the main course web page to submit a file containing your solutions. You can use any common file format, including plain text, word, or pdf. If you wish, you could also scan in a hand-written solution and submit that, but if you do that, please be sure your handwriting is neat and legible. Please be sure to include your name at the top of your answers.

	Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to Hal Perkins]