Assume that a cache is organized as follows: (s, E, b) == (3, 1, 5) Matrix a[0][0] address maps to the first 8 bytes of the first set of the cache the cache is initially empty The only memory accesses are to the entries into array a. Variables i,j, and sum are stored in registers. What percentage of reads in the following code will result in a cache miss? (i.e the miss rate) Explain. int sum_array_rows(double a[16][16]) { } int i, j; double sum = 0; for (i = 0; i < 16; i++) for(j = 0; j < 16; j++) sum += a[i][j]; return sum;

Assume that a cache is organized as follows: (s, E, b) == (3, 1, 5) Matrix a[0][0] address maps to the first 8 bytes of the first set of the cache the cache is initially empty The only memory accesses are to the entries into array a. Variables i,j, and sum are stored in registers. What percentage of reads in the following code will result in a cache miss? (i.e the miss rate) Explain. int sum_array_rows(double a[16][16]) { } int i, j; double sum = 0; for (i = 0; i < 16; i++) for(j = 0; j < 16; j++) sum += a[i][j]; return sum;

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

Similar questions

Microprocessor 8086 write An array called (A) has 300 unsigned byte numbers (chose your Owen data), write only one assemble to the following1-store the Maximum number of (A) in physical address AB200h. 2- store the Minimum number of (A) in the physical address CD100h. 3-rearrange the array given (A) ascending and save the new array in the memory starting at 3050e 4-save only the maximum odd number in the logical address 5200:0350
For the following loop assume the array arr2[][] has never been referenced before in the code. Also assume that a cache line is 32 Bytes, and an int is 4 Bytes. 1. How many memory references are there?
For the following loop, assume the array arr2[][] has never been referenced before in the code. Also assume that a cache line is 32 Bytes, and an int is 4 Bytes. 1. How many memory references are there?2. How many cache misses are there?
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: 1 2 3 4 5 6 7 8 9 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 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
For the following loop assume the array arr2[][] has never been referenced before in the code. Also assume that a cache line is 32 Bytes, and an int is 4 Bytes. 1. How many cache misses are there?
The following blocks are referenced by the CPU and to be fetched from the RAM to the cache sequentially: (ij k L L jmj n L mj m L k sįPi o k) Assume that the cache set is empty and all the above blocks can be inserted into the set. Use the LRU algorithm to fill in the following table that describes the status of the cache locations for each called block .
This function will be able to look at which fields in a log entry that it needs to. When you use 64-byte cache blocks and don't prefetch, the following code calculates the average number of cache misses for each entry in the cache.
Q3) A direct mapped cache has 4 blocks. Each block is 2 words, where a word is 4 bytes. The following load instructions with the given byte addresses are executed sequentially in a program. Calculate the cache block indices for each address and identify whether the load causes a hit or miss. SHOW YOUR CALCULATIONS Hit/Miss Memory Byte Address 11100101 Block Index Tag Ib. 01011101 Ib. 01100110 11011011 lb 11111111
80x86 Intel Assembly language Write an 80x86 Intel assembly language program: Declare two integer arrays and initialize the first one with 7, 6, 5, 4 and 3. Initialize the second one with 3, 6, 9, 10, 15 Declare the third array of the same size but do not initialize. Your program must initialize ESI and EDI to have the addresses of the array1 and array2 respectively. Use EBX and place the address of the third array in that register. Use these registers to add the first element of the first array to the first element of the second array and place the result in the third array. Updated the values of these registers so all of them refer to the next location.
7. A 32-bit computer has a data cache memory with 8 KB and lines of 64 bytes. Calculate the hit ratio of this program. double a [1024], b[1024], c[1024], d[1024]; // A double occupies 8 bytes // the array are consecutively stored // in memory for (int i = 0; i < 1024; i++) a[i] = b[i] + c[i] +d[i]; The cache uses a direct mapped function and write-back policy. The cache uses a full associative cache with LRU as replacement algorithm. The cache uses a 2-way associative cache and a 4-way associative cache with LRU as replacement algorithm.
1. Suppose an array with six rows and eight columns is stored in a row major order starting at address 20 (base 10). If each entry in the array requires only one memory cell, what is the address on the entry in the third row and fourth columns? What if each entry requires two memory cells?
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…