2. Consider the following fragment of code written in C. Note that C uses so-called row...

  

Transcribed Image Text:

2. Consider the following fragment of code written in C. Note that C uses so-called row major order for matrices where elements within the same row are stored contiguously. for (i=0; i <8; i++){ } for (j=0; j < 2000; j++){ } a[i][j] = b[i][0] + a[i][j] a. References to which variables show temporal locality? b. References to which variables show spatial locality? c. Switch the order of the loop nests (outer loop is over j, inner loop is over i). How does this change your responses. d. Which order of loop nests do you expect will give better performance? 2. Consider the following fragment of code written in C. Note that C uses so-called row major order for matrices where elements within the same row are stored contiguously. for (i=0; i <8; i++){ } for (j=0; j < 2000; j++){ } a[i][j] = b[i][0] + a[i][j] a. References to which variables show temporal locality? b. References to which variables show spatial locality? c. Switch the order of the loop nests (outer loop is over j, inner loop is over i). How does this change your responses. d. Which order of loop nests do you expect will give better performance?

Answer rating: 100% (QA)

Answer Lets analyze the given code fragment and answer each question a References to which variables ... View the full answer