Section 5.5.3 illustrates the effect of different cache-mapping techniques, using the program in Figure 5.19. Suppose that this program is changed so that in the second loop the elements are handled in the same order as in the first loop, that is, the control for the second loop is specified as

Derive the equivalents of Figures 5.20 through 5.22 for this program. What conclusions can be drawn from this exercise?

Transcribed Image Text:

for i = 0 to 9 do