Calvin College

5) Recall that we have two write policies and write allocation policies, and their combination can be implemented either in L1 or L2 cache. Assume the following choice for L1 and L2 caches: L1 L2 Write-through, non-write allocate Write-back, write allocate Describe the procedure of handling an L1 write-miss, considering the component involved and the possibility of replacing a dirty block. (P&H 5.4, §5.3, 5.8) SOLUTION: When an L1 write miss occurs, a cache block is not allocated in L1 f...

(5) In this exercise we look at memory locality properties of matrix computation. The following code is written in C, where elements within the same row are stored contiguously. Assume each word is a 32-bit integer. (P&H 5.1, §5.1) for (I=0; I<8; I++) for (J=0; J<8000; J++) A[I][J]=B[I][0]+A[J][I]; a. How many 32-bit integers can be stored in a 16-byte cache block? b. References to which variables exhibit temporal locality? c. References to which variables exhibit spatial locality...

ENGR 325 HOMEWORK 7. 1. (5) In this exercise we look at memory locality properties of matrix computation. The following code is written in C, where elements within the same row are stored contiguously. Assume each word is a 32-bit integer. (P&H 5.1, §5.1) for (I=0; I<8; I++) for (J=0; J<8000; J++) A[I][J]=B[I][0]+A[J][I]; a. How many 32-bit integers can be stored in a 16-byte cache block? b. References to which variables exhibit temporal locality? c. References to which variables ...

ENGR 325 HOMEWORK 7 KEY FALL 2020. In this exercise we look at memory locality properties of matrix computation. The following code is written in C, where elements within the same row are stored contiguously. Assume each word is a 32-bit integer. (P&H 5.1, §5.1) for (I=0; I<8; I++) for (J=0; J<8000; J++) A[I][J]=B[I][0]+A[J][I]; a. How many 32-bit integers can be stored in a 16-byte cache block? b. References to which variables exhibit temporal locality? c. References to which...