Consider the following code: int M[128]; int num = 0; for (int i=0; i ...

 

Transcribed Image Text:

Consider the following code: int M[128]; int num = 0; for (int i=0; i <64; i++) { } num += M[i] * M[i + 64] Assume Array M begins at address 0 and the cache begins empty. Variables i and num are stored in registers and not memory = sizeof(int) 4 bytes A) (4 Points): Suppose our D-cache is 256-bytes, 2-way set associative, with 8-byte blocks. What is the cache miss rate? Activate Wind Go to Settings to a Consider the following code: int M[128]; int num = 0; for (int i=0; i <64; i++) { } num += M[i] * M[i + 64] Assume Array M begins at address 0 and the cache begins empty. Variables i and num are stored in registers and not memory = sizeof(int) 4 bytes A) (4 Points): Suppose our D-cache is 256-bytes, 2-way set associative, with 8-byte blocks. What is the cache miss rate? Activate Wind Go to Settings to a

Answer rating: 100% (QA)

To calculate the cache miss rate for the given code snippet we need to consider the cache organizati... View the full answer