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.

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.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: this is basically compueter architecture add main code and functions to randomly populate a .space…

A: this is basically compueter architecture add main code and functions to randomly populate a .space…

Q: Which of the following statements about C are TRUE? Check all that apply Assuming an array has been…

A: Let's discuss which of the following are correct statement and which are not

Q: Write a subroutine that finds the total number of elements in an array that are divisible by 8. The…

A: The current scenario here is to find the total number of elements in an array that are divisible by…

Q: { if(used capacity) { resize((1.5*capacity) + 1); } if(current index >= used) current_index = 0; { }

A: we must declare sequence variables them before using them . Below program is a similar example:

Q: Write a program in assembly code that performs a calculation on word and bytes arrays. R = W + B -…

A: Anatomy of a C program for AVR The following presents a rough overview and breakdown of a demo…

Q: int array 1 [H][J]; int array2[J][H]; void copy_array(int x, int y) { array2[x][y] = array1[y][x]; }…

A: Assembly code An assembler is a tool that transforms Java assembly code into executable machine…

Q: A compulsory cache miss happens the first time the CPU reads any bytes in a memory Such cache misses…

A: It is defined as the data or contents of the main memory that are used frequently by CPU are stored…

Q: Given

A: Given: Base address of integer array = 200 Requirement: Find the address of element at index 4 in…

Q: Computer Science Write a C program that calls malloc() 1001 times allocating blocks of size 4 each.…

A: Answer: I have done code and also I have attached code and code screenshot as well as output

Q: A computer program has 50 instructions. The clock rate of this computer is 10 GHz. What is the CPU…

A: Here we have given step by step result for the obtaining the solution

Q: ) Consider the following C code snippet. void swap(int *xp, int *yp) { int temp = *xp;…

A: In this RISC-V assembly language implementation, converted a given C code snippet into assembly…

Q: C++ Write a multithreaded program using only Pthreads that uses several threads to multiply two…

A: ANSWER:-

Question

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.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Given data

VIEW

Step 2: Calculation

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Similar questions

Provide simple explanation
Using C Language In this function, b has the address of a memory buffer that is num_bytes long. The function should repeatedly copy the 16 byte pattern that pattern16 points at into the memory buffer until num_bytes have been written. If num_bytes is not a multple of 16, the final write of the 16 byte pattern should be truncated to finish filling the buffer. void memset16(void *b, int num_bytes, void *pattern16) For example if the 16 bytes that pattern16 points at is 00 11 22 33 44 55 66 77 88 99 aa bb cc dd ee ff, then memset(b, 20, pattern16) should write to the buffer pointed at by p the 20 bytes 00 11 22 33 44 55 66 77 88 99 aa bb cc dd ee ff 00 11 22 33. Use SSE instructions to improve efficiency. Here's pseudocode. x = SSE unaligned load from pattern16while (num_bytes >= 16) SSE unaligned store x to p advance p by 16 bytes decrement num_bytes by 16while (num_bytes > 0) store 1 byte from pattern16 to p advance p by 1 byte advance pattern16 by 1 byte…
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?
Consider two integer arrays B and D of 100 elements. Let X2 and X3 contain the base address of array "B" and "D", respectively, and the index į is in X0, h is in X10. Write LEGV8 code to perform the following operations: (a) Get B[15] from memory and put it in register X5. (b) Put the value 132 in D[6]. (c) Translate the following C code into LEGv8 instructions int j = 50, h; do { D[2*j] = (B[j] + B[j+2])*9 - h; j^j -2; while {j >0}; DO NOT use multiply instruction in your code, use shift instruction for multiplication instead! (d)How many instructions are executed during the running of the code in (c), and how many memory data references are made during executio'n?
In c language Consider this array unsigned int data [ ] = { 0xA3A4A5A6, 0x12131415 } write a for loop to print the array values in this order 0x1415 0x1213 0xA5A6 0xA3A4
Security: 1. Buffer overflow A C code example for Buffer Overflow is below: #include #define BUFFER SIZE 256 int main(int argc, char *argv[]) { char buffer[BUFFER SIZE]; if (argc <2) return -1; else { } strcpy(buffer,argv[1]); return 0; } (a) Explain the C code here on what it is doing. (b) Explain why buffer overflow may happen (c) Explain how you can modify the code to avoid buffer overflow.
Computer Science Selection sort Algorithm (Assembly language - masm in 32 bits) Write a program that sorts an array of a set of numbers in assembly language, masm in 32 bits. Sort the numbers in the array from ascending to descending and simply print the array. Remember the time complexity of the sorting algorithm is O(n^2) The array - {25, 62, 91, 15, 10, 11, 35, 78}
Convert the following pseudo code into assembly code. int array_list() = {10, 11, 13, 18, 21, 23, 24, 17, 45}; int array_size = sizeof array_list / sizeof sanple; int index = 0; / index for while loop int sun- 0; // accumulate the result for (current_size = array_size ; current_size > 8 ; current_size--){ while ( index < current_size){ if( array_list[index] is even ){ sum += array_list[index]; index + 1; Store the result in the variable – sum.
1. Convert the following C code into MIPS assembly: void array_comp(int num) { int array [10]; int i; for (i=0; i= 0) return 1; else return 0; int sub (int a, int b) { return a-b; }