Given Information : The following matrix transpose routine is given: //array declaration typedef int array[4][4]; //function to transpose array void transpose2(array dst, array src) { //variable declaration int i,j; //iterate through first array for(i=0;i<4;i++) { //iterate through second array for(j=0;j<4;j++) { //transpose matrix dst[j][i]=src[i][j]; } } } The machine that runs the code has the following properties: The size of integer is “4”. The “src” array starts at address “0” and “dst” array starts at address “64”. There is a single L1 data cache that is direct-mapped, write-through and write allocate with a block size of 16 bytes. The cache has a total size of “32” bytes and the cache is initially empty. The only sources of read and write misses are accesses to the “src” and “dst” array.

Question

Want to see the full answer?

Answer 1

Question

Chapter 6, Problem 6.34HW

Program Plan Intro

Given Information:

The following matrix transpose routine is given:

//array declaration

typedef int array[4][4];

//function to transpose array

void transpose2(array dst, array src)

{

//variable declaration

int i,j;

//iterate through first array

for(i=0;i<4;i++)

{

//iterate through second array

for(j=0;j<4;j++)

{

//transpose matrix

dst[j][i]=src[i][j];

}

}

}

The machine that runs the code has the following properties:

The size of integer is “4”.

The “src” array starts at address “0” and “dst” array starts at address “64”.

There is a single L1 data cache that is direct-mapped, write-through and write allocate with a block size of 16 bytes.

The cache has a total size of “32” bytes and the cache is initially empty.

The only sources of read and write misses are accesses to the “src” and “dst” array.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

2-Caches are important to providing a high-performance memory hierarchy to processors. Below is a list of 32-bit memory address references, given as word addresses. a. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with two-word blocks and a total size of 4 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. 42, 180, 46, 185, 189, 3, 181, 43, 6, 189, 65, 190 b. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with four-word blocks and a total size of 4 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. c. For each of these references, identify the binary address, the tag, and the index given a two way associative cache with two-word blocks and a total size of 4 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty d. For each of these…

Suppose a computer using direct mapped cache has 232 byte of byte-addressable main memory, and a cache of 1024 blocks, where each cache block contains 32 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag, block, and offset fields? c) To which cache block will the memory address 0x000063FA map?

This function will be able to determine the fields in a log entry it needs to look at in order to do its job properly. The following line of code computes the average number of cache misses for each item in the cache when 64-byte cache blocks are used without any prefetching being performed by the program.