Stevens Institute Of Technology CS 514 Homework 5.

CS 514 Homework 5: 100 Points Fall 2018
This Homework contains examples on caches, memory hierarchy design, and cache optimization.
Please submit your answers in an MS Word document and upload it in Canvas by the due date. If you don’t have or
don’t like MS Word, you can use pdf but we will not be able to insert comments in your pdf document.
Present your work neat, clear, organized, logical, and make your case; don’t leave it to our interpretation of your
answer. There is 10% penalty per day for delay in submitting the homework.
1. (16 Points) Exercise B.1 Parts a and b
Ans. a. Average access time = (1-miss rate) * hit time + miss rate*miss time
= 0.97*1 + 0.03*110 = 4.27 cycles
b. Probability of hit = 64KB/1GB = 0.00006104
Average access time = 0.00006104*1 + 0.99993896*110 = 109.99334664 cycles
2. (28 Points) Exercise B.5 Appendix B. Assume L1 cache Write-through with no write-allocate and L2 cache
Write-back with write-allocate.
Hint: A useful tool for solving this type of problem is to extract all of the available information from the
problem description. It is possible that not all of the information will be necessary to solve the problem, but
having it in summary form makes it easier to think about.