3. Caching In this question, let's assume that we have a 16-bit system with a single level 6-way set associative cache with 8 sets, and a cache block size of 64 bytes. How many bits are needed for the setID and the tags? Draw the breakdown of the tag/index/byte- in-block bits. What is the total size of this cache? For the following program, assume that an integer is 4 bytes. int i; // Assume these variables are stored in the registers. int a [65536]; // Assume that a = 0x1000 int b[65536]; // Assume that b = 0x8000000 for (i=0; i<1024; i++) a[i* 8] = i; for (i=0; i<1024; i++) b[i* 8 ] = a[i* 8 ] ++; Let's asssume that the array is initialized to zero and that the variable i is already stored on the register. What is my cache hit rate? Show your work.

3. Caching In this question, let's assume that we have a 16-bit system with a single level 6-way set associative cache with 8 sets, and a cache block size of 64 bytes. How many bits are needed for the setID and the tags? Draw the breakdown of the tag/index/byte- in-block bits. What is the total size of this cache? For the following program, assume that an integer is 4 bytes. int i; // Assume these variables are stored in the registers. int a [65536]; // Assume that a = 0x1000 int b[65536]; // Assume that b = 0x8000000 for (i=0; i<1024; i++) a[i* 8] = i; for (i=0; i<1024; i++) b[i* 8 ] = a[i* 8 ] ++; Let's asssume that the array is initialized to zero and that the variable i is already stored on the register. What is my cache hit rate? Show your work.

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

Consider the following problem:You are given a tower of n disks and three pegs. Disks are initially stacked in decreasing size (from the largest in the bottom to the smallest at the top) on one of the pegs. The objective is to transfer the entire tower to one of the other pegs (the third, let’s say), moving only one disk at a time and never a larger one onto a smaller one. (1) Write a code/pseudocode that uses the divide and conquer technique to solve the problem. (2) Write a recurrence relation for the time complexity of the problem and explain how you came up with the relation. (3) then express the time taken by your algorithm in Big-O notation.
Suppose a malloc implementation returns 8-byte aligned addresses and uses an explicit free list where the next and previous pointers are each 32-bits. Blocks have a 32-bit header and 32-bit footer, where the low-order bit of the header and footer are used to indicate whether the block is allocated (1) or free (0). Furthermore, the block size (which includes the header, payload, footer, and any necessary padding) is rounded up to the nearest multiple of 8, and this size (in bytes) is stored in the header and footer. Assume any padding must be between the payload and the footer.If we call malloc(1), what block size will be allocated, in bytes? With the same conditions as #1, and assuming we've already called malloc(1), if the heap used by malloc starts at address 0x4000 (16384 in decimal), what address would be returned if we then called malloc(32)?
Write a fortran 90 program using subroutine Let A be the 50x50 tridiagonal matrix as shown below: 5 -1 0 0 x1 1 ... -1 0 0 x2 2 ... -1 5 0 x3 3 0 ... ... ... ... 0 5 -1 x49 49 0 0 -1 5 x50 50 *** Consider the problem Ax = b, find the solutions for the following vectors b b = [1,2,3,...,49,50] 500000 TSTOOO -1 5 0 0 000
Suppose we have the following memory allocator setup for the block headers. Note this model may be slightly different from the book and project. Headers are single 4-byte integers and store both the size of the block and meta information packed into 32 bits. The unused bits after the size is stored are used to store the meta-information. Memory requests must be in multiples of 8. How many bits at the end of the 4-byte header can be used to store meta-information?
An integer array [41,11,121,163] is stored in memory. Each integer has 32 bits. Suppose the first byte of the array data has a hexadecimal address of F8D4A0C8, and the content of the $s4 register is also F8D4A0C8 in hexadecimal. List the integer values in decimal in the array starting with element 0, after the following MIPS code is executed. Separated them by comma, for example, 11,22,33,44. lw $t5, 0($s4) lw $t4, 12($s4) add $t4, $t5, $t4 Sw $t4, 0($s4) Answer:
Using C++ Language (ordered linked list & simply)
Question 10 Match the data types on the left with range of values they can represent. The range depends on the number of bytes (8-bits per byte). Assume that a modern 64-bit operating system is being used. NOTE: You can verify the size of each data type using the sizeof operator. unsigned long long float double address of char address of long long address of double -9,223,372,036,854,775,808 [Choose] -32,768 to 32,767 0 to 65,535 0 to 4,294,967,295 -128 to 127 (+/-)1.2E-38 to (+/-)3.4E+38 0 to 18,446,744,073,709,551,615 (+/-)2.3E-308 to (+/-)1.7E+308 -9,223,372,036,854,775,808 to 9,223,372,036,854,775,807 -2,147,483,648 to 2,147,483,647 0 to 255 [Choose] [Choose]
Q1:.
Please solve in one hour.
Given that two arrays X1 and X2 are stored in ROM where each array consists of ten byte elements. Produce array Z of the same size where: Z[i]= 9*X1[i] + X2[i] where i-0,1,..9 Store Z in internal RAM starting at address 30H. Run your program with the following data (shown in Hex): X1: 35, A3, 7B, 90, 5C, 4F, 38, D5, 39, 7A X2: B0, 36, 2A,75, 82, 9B,C4, 7D,18,B4 Submission: 1- Assembly file including your code. 2- PDF file including a screen capture showing the contents of RAM memory locations,30H to 39H, that store the results after executing the code.
Please give me a step by step solution for this question, using only the regular c-instructions offered with hack assembly language.
Asap please it should be correct , i will downvote right away