Cache Memory Caches depend on the locality principle – if you access memory locations near to each other,then you will get better performance because the cache will pull in a bunch of nearby locationsevery time you access main memory. Assume that multi-dimensional arrays in C are stored in “row major order”, that is, the elements in each row are stored together Example:int test[3][5] = {{1, 2, 3, 4, 5},{6, 7, 8, 9, 10},{11, 12, 13, 14, 15}} Would be laid out in memory like:123456789101112131415 Which of these two programs fragments (a or b) should have better cache performance?You need only answer “a” or “b” – no explanation needed. // begin fragment aint big[100,1000];for (i=0, i<100, i++) {for (j=0, j<999, j++) {big[i,j] += big[i,j+1];}}// end fragment a // begin fragment bint big[100,1000];for (j=0, j<999, j++) {for (i=0, i<100, i++) {big[i,j] += big[i,j+1];}}// end fragment b Caches depend on the locality principle – if you access memory locations near to each other,then you will get better performance because the cache will pull in a bunch of nearby locationsevery time you access main memory. Assume that multi-dimensional arrays in C are stored in"row major order", that is, the elements in each row are stored togetherExample:int test[3][5]{{1, 2, 3, 4, 5},{ 6, 7, 8, 9, 10},{11, 12, 13, 14, 15}}Would be laid out in memory like:中146.7101112131415Which of these two programs fragments (a or b) should have better cache performance?You need only answer "a" or “b" – no explanation needed.-// begin fragment aint bigl100,1000];for (i=0, i<100, i++) {for (j=0, j<999, it {big[inl += big[i,j+1];}// end fragment a// begin fragment bint big[100,1000];for (j=0, j<999, itt) {for (i=0, i<100, į++) {big [iil += big[i,j+1];}}// end fragment b

Answered: Cache Memory Caches depend on the…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Cache Memory

Caches depend on the locality principle – if you access memory locations near to each other,

then you will get better performance because the cache will pull in a bunch of nearby locations

every time you access main memory. Assume that multi-dimensional arrays in C are stored in “row major order”, that is, the elements in each row are stored together

Example:

int test[3][5] = {

{1, 2, 3, 4, 5},

{6, 7, 8, 9, 10},

{11, 12, 13, 14, 15}

}

Would be laid out in memory like:

Which of these two programs fragments (a or b) should have better cache performance?

You need only answer “a” or “b” – no explanation needed.

// begin fragment a

int big[100,1000];

for (i=0, i<100, i++) {

for (j=0, j<999, j++) {

big[i,j] += big[i,j+1];

}

// end fragment a

// begin fragment b

int big[100,1000];

for (j=0, j<999, j++) {

for (i=0, i<100, i++) {

big[i,j] += big[i,j+1];

}

// end fragment b

Caches depend on the locality principle – if you access memory locations near to each other,
then you will get better performance because the cache will pull in a bunch of nearby locations
every time you access main memory. Assume that multi-dimensional arrays in C are stored in
"row major order", that is, the elements in each row are stored together
Example:
int test[3][5]
{
{1, 2, 3, 4, 5},
{ 6, 7, 8, 9, 10},
{11, 12, 13, 14, 15}
}
Would be laid out in memory like:
中
1
4
6.
7
10
11
12
13
14
15
Which of these two programs fragments (a or b) should have better cache performance?
You need only answer "a" or “b" – no explanation needed.
-
// begin fragment a
int bigl100,1000];
for (i=0, i<100, i++) {
for (j=0, j<999, it {
big[inl += big[i,j+1];
}
// end fragment a
// begin fragment b
int big[100,1000];
for (j=0, j<999, itt) {
for (i=0, i<100, į++) {
big [iil += big[i,j+1];
}
}
// end fragment b

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions