COMPUTER ORGANIZATION November 26, 2002
WC3824-001
(CSEE) HOMEWORK #7
PROF. TONY JEBARA
|
DUE |
UNDER
MY DOOR IN MY OFFICE CEPSR 605, BY FRIDAY, DECEMBER 6th BEFORE 2
PM. |
Please
use the class newsgroup (bulletin board) for questions, updates, clarifications,
and corrections related to the homework. It is linked off of the class home
page: http://www.cs.columbia.edu/~jebara/3824.
As a second resort, you can also email a TA directly: am2104@columbia.edu, djh44@columbia.edu or ah679@columbia.edu.
1. (10
points):
Patterson and Hennessy Exercise 7.7.
2. (10
points): Patterson
and Hennessy Exercise 7.8.
3. (10
points):
Patterson and Hennessy Exercise 7.20.
4. (10
points):
Patterson and Hennessy Exercise 7.22.
5. (15
points):
Patterson and Hennessy Exercise 7.24.
6. (20
points):
Patterson and Hennessy Exercise 7.27.
7. (25
points): Guessing
the Cache. Assume you are given a 16-word cache for a 64-word memory. You
don’t know the exact details of the cache but you can tell when it exhibits a
hit or a miss. You read the following word addresses and they
trigger
either a hit or a miss as follows:
|
Word
Address |
6 |
7 |
15 |
21 |
15 |
19 |
61 |
13 |
9 |
61 |
37 |
19 |
|
Miss or
Hit ? |
M |
H |
M |
M |
H |
M |
M |
H |
M |
H |
M |
H |
Assume
that memory addresses start at 0 and go up to 63 for a total of 64 words. Also,
the cache starts off cold or initially empty. Assume the cache is N-way
associative with block size of B words, where N and B are positive integer
powers of 2 (i.e. B=2b and N=2n for positive integers b
and n). If the cache is set-associative or fully-associative, assume LRU
replacement policy. Determine the value of N and B from the above pattern of
hits and misses. For full credit, justify your answer and show all work.