Given the assumptions in Problem 6.38, determine the cache performance of the following code: 1 2...

    

Transcribed Image Text:

Given the assumptions in Problem 6.38, determine the cache performance of the following code: 1 2 3 4 5 6 7 8 9 10 11 12 for (i =0; i < 16; i++) { for (j = 0; j < 16; j++) { square [i] [j].y = 1; } } = for (i = 0; i < 16; i++) { for (j 0; j <16; j++) { square [i] [j] .c = 0; square [i] [j].m = 0; square [i] [j].k = 0; } } A. What is the total number of writes? B. What is the total number of writes that miss in the cache? C. What is the miss rate? Given the assumptions in Problem 6.38, determine the cache performance of the following code: 1 2 3 4 5 6 7 8 9 10 11 12 for (i =0; i < 16; i++) { for (j = 0; j < 16; j++) { square [i] [j].y = 1; } } = for (i = 0; i < 16; i++) { for (j 0; j <16; j++) { square [i] [j] .c = 0; square [i] [j].m = 0; square [i] [j].k = 0; } } A. What is the total number of writes? B. What is the total number of writes that miss in the cache? C. What is the miss rate?