Question: 5. [20 points] Miscellaneous short answer questions a. [4 points] What are the potential advantage(s) of the write-through policy over the write-back policy? What are

 5. [20 points] Miscellaneous short answer questions a. [4 points] What

5. [20 points] Miscellaneous short answer questions a. [4 points] What are the potential advantage(s) of the write-through policy over the write-back policy? What are the potential advantage(s) of the write- back policy over the write-through policy? b. [3 points] If the page size is 8KB, what is the minimum associativity needed for a 64KB cache, if the cache is physically-indexed/physically-tagged, and we want to access the cache and TLB in parallel? c. [3 points] Ifa WBWALI cache is augmented with a victim cache, writebacks to the L2 cache can only come from the victim cache, not the Ll cache. Explain why this is so d. [3 points] According to the 3C's model of misses, is the following statement true or false? "A fully-associative cache may experience conflict misses." [3 Points] Insert an optimal prefetch instruction before the load of ali]. The miss penalty is 100 ns e. for (i-0; i Kmisc. computation> 5. [20 points] Miscellaneous short answer questions a. [4 points] What are the potential advantage(s) of the write-through policy over the write-back policy? What are the potential advantage(s) of the write- back policy over the write-through policy? b. [3 points] If the page size is 8KB, what is the minimum associativity needed for a 64KB cache, if the cache is physically-indexed/physically-tagged, and we want to access the cache and TLB in parallel? c. [3 points] Ifa WBWALI cache is augmented with a victim cache, writebacks to the L2 cache can only come from the victim cache, not the Ll cache. Explain why this is so d. [3 points] According to the 3C's model of misses, is the following statement true or false? "A fully-associative cache may experience conflict misses." [3 Points] Insert an optimal prefetch instruction before the load of ali]. The miss penalty is 100 ns e. for (i-0; i Kmisc. computation>

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!