int data[N]; int compute variance () ( int sumi 0, sum20, result; int i; for(i=0;i <...

 

Transcribed Image Text:

int data[N]; int compute variance () ( int sumi 0, sum20, result; int i; for(i=0;i< N;i++) ( suml data[i]; 1 suml sumi / N for (i = 0; i < N;i++) ( sum2 data[i] data[i]; 1 sum2 - sum2 / N result (sum2- suml sumi); return result; 6. Consider the function compute variance listed above that computes the variance of integer numbers stored in the integer array called data: Consider the case where N is 16 and 32. How many cache misses will there be in each case with the following assumptions: an integer is 4 bytes long • a block size of 4 bytes using direct mapped cache int data[N]; int compute variance () ( int sumi 0, sum20, result; int i; for(i=0;i< N;i++) ( suml data[i]; 1 suml sumi / N for (i = 0; i < N;i++) ( sum2 data[i] data[i]; 1 sum2 - sum2 / N result (sum2- suml sumi); return result; 6. Consider the function compute variance listed above that computes the variance of integer numbers stored in the integer array called data: Consider the case where N is 16 and 32. How many cache misses will there be in each case with the following assumptions: an integer is 4 bytes long • a block size of 4 bytes using direct mapped cache

Answer rating: 100% (QA)

91 If N16 then we will suffer a cache miss in the first for loop ... View the full answer