13. A os anquence of cache bieck add sis of length N and contains n unie Heckadlresses The ber of uniue blockdresses betwoen Iwe conseeuve accesseste the same block adress is baunded aboveby k What is the miss ratio if he accessequence is pansed through cache ofassociativity A 2k esercising least recerlysed replacement policy

Here is your answer with an explanation.

An access seqetce of cache back addees is of length Nand coniains n unio leck kiresses The aber of uniue back atresses betwoen lwe conseve accees ethe sume hlock adress is banded e byk Whar is the miss ratio if the acce sequence is psed hrough a cache of aociativity A k exenising least recerly sed replacement poliey

An access seqetce of cache back addees is of length Nand coniains n unio leck kiresses The aber of uniue back atresses betwoen lwe conseve accees ethe sume hlock adress is banded e byk Whar is the miss ratio if the acce sequence is psed hrough a cache of aociativity A k exenising least recerly sed replacement poliey

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

“Prefetching” is a technique that leverages predictable address patterns to speculatively bring in additional cache blocks when a particular cache block is accessed. One example of prefetching is a stream buff er that prefetches sequentially adjacent cache blocks into a separate buff er when a particular cache block is brought in. If the data is found in the prefetch buff er, it is considered as a hit and moved into the cache and the next cache block is prefetched. Assume a two-entry stream buff er and assume that the cache latency is such that a cache block can be loaded before the computation on the previous cache block is completed. What is the miss rate for the address stream above?Cache block size (B) can aff ect both miss rate and miss latency. Assuming a 1-CPI machine with an average of 1.35 references (both instruction and data) per instruction, help find the optimal block size given the following miss rates for various block sizes. 8: 4% 16: 3% 32: 2% 64: 1.5% 128: 1%…
Assume one file has r = 10^6 records. Each record takes R = 100 bytes, of which 10 bytes are for the key of record. Suppose the key balues range from 1 to 1,000,000, inclusive. Assume the block size B is 1000 bytes for all files, and that an address (block pointer, tree node poiinter, or data record pointer) takes 10 bytes. How many data block accesses on the average are needed to fetch a record by using linear search?
Assume there are three small caches, each consisting of four one word blocks. One cache isfully associative, a second is two way set associative, and the third is direct mapped. Find thenumber of misses for each cache organization given the following sequence of block addresses:1,7, 6, 5, 1, and 7.
Develop a C/C++ program that accepts the name of a memory trace file as a command line argument. Use the data to simulate a set associative cache using LRU replacement. Additional command line arguments will be needed to identify the details of the simulated cache. The arguments should appear in the following order: the memory trace input file X, where 2X == the number of direct-mapped sets Y, where 2Y == the number of blocks per set Z, where 2Z == the number of cached words per block Your program (say it's a compiled C program) could be run like this: ./cache data.tra 3 2 4 This would simulate an 8 set associative LRU cache with 4 blocks per set, where each block caches 16 addresses. NOTE… the reason I've chosen to use exponents for arguments is to ensure we have powers of 2 for everything. Trace File The trace file is line based with each line containing a memory address requested, in hex. Please note this data is real, so the addresses are larger than 32-bits. In…
A two-level cache hierarchy of L1 and L2 with 2 and 3 blocks respectively is designed. Both L1 and L2 are fully-associative with LRU replacement policy. A sequence of references (block addresses from left to right, denoted as letters) is given in the table. Both caches are empty initially. You need to simulate the contents of L1 and L2 for the given sequence. Note that each request goes to L1 first. A request is issued to L2 only if it misses L1. In case of a L2 hit, the requested block is fetched from L2 and placed into L1, both in the MRU position. In case of a L2 miss, the block is loaded from memory into both L1 and L2 caches in the MRU position. The cache contents are displayed by the block addresses from MRU position to LRU position, separated by a comma.
Recall that we have two write policies and write allocation policies, and their combinations can be implemented either in L1 or L2 cache. Assume the following choices for L1 and L2 caches: L1 L2 Write through, non-write allocate Write back, write allocate 1. Buff ers are employed between diff erent levels of memory hierarchy to reduce access latency. For this given confi guration, list the possible buff ers needed between L1 and L2 caches, as well as L2 cache and memory.2. Describe the procedure of handling an L1 write-miss, considering the component involved and the possibility of replacing a dirty block.3. For a multilevel exclusive cache (a block can only reside in one of the L1 and L2 caches), confi guration, describe the procedure of handling an L1 write-miss, considering the component involved and the possibility of replacing a dirty block.Consider the following program and cache behaviors. Data Reads per1000 Instructions Data Writes per1000 Instructions Instruction…
One way to speed up the resolving of names is to implement a cache that remembers recently looked-up {name, object} pairs. a. What problems do synonyms pose for cache designers, as compared with caches that don’t support synonyms? b. Propose a way of solving the problems if every object has a unique ID.
#include <stdio.h>#include <stdlib.h> #define SEQ_SIZE 50#define CACHE_SIZE 3 int page_reference_sequence[SEQ_SIZE]; int read_file(char *filename) // read in the page reference sequence from the file{ FILE *input; int i, n; if ((input = fopen(filename, "r")) == NULL) { printf("The input file does not exist.\n"); exit(1); } for (i = 0; i < SEQ_SIZE; i++) { if (fscanf(input, "%d", &page_reference_sequence[i]) == EOF) { // end of file n = i; // total number of page reference i = SEQ_SIZE; // stop reading from file } } fclose(input); printf("Input page reference sequence: "); for (i =0; i < n; i++) { printf("%d ", page_reference_sequence[i]); } printf("(total %d references)\n", n); return n; // return the total number of page reference} void FIFO(int n){ // write your own code for the FIFO policy // based on the input file content, print out a table similar to the Figure 22.2 int i;…
Please help me in this question: 16/All of the following are cache replacement algorithms except: a. LRU b. FIFO c. Random d. Thrashing Thank you!
CA_6 We study the properties of cache memory, and for reasons of easier design and efficient circuits, we assume that the cache capacity is 2i Bytes, and cache line size is 2j Bytes, with i and j being natural numbers: (a) How many bits should the tag field have? And can the tag field contain 0 bit (i.e., be empty)? Elaborate (b) Repeat the above for the index field. (c) Repeat the above for the byte-offset field. (d) Finally, depict a figure showing a cache line, indicate what fields it possibly has, state the possible sizes of these fields, and explain the uses of these fields.
The heart of the recent hit game SimAquarium is a tight loopthat calculates the average position of 256 algae. You areevaluating its cache performance on a machine with a 1,024-byte direct-mapped data cache with 16-byte blocks (B = 16).You are given the following definitions:1 struct algae_position {2 int x;3 int y;4 };56 struct algae_position grid[16][16];7 int total_x = 0, total_y = 0;8 int i, j;You should also assume the following:sizeof(int) = 4.grid begins at memory address 0.The cache is initially empty.The only memory accesses are to the entries of the arraygrid. Variables i, j, total_x , and total_y are storedin registers.Determine the cache performance for the following code:1 for (i = 0; i < 16; i++) {2 for (j = 0; j < 16; j++) {3 total_x += grid[i][j].x;4 }5 }67 for (i = 0; i < 16; i++) {8 for (j = 0; j < 16; j++) {9 total_y += grid[i][j].y;10 }11 }A. What is the total number of reads?B. What is the total number of reads that miss in thecache?C. What is the miss…
Suppose you experience a cache miss on a block (let's call it block A). You have accessed block A in the past. There have been precisely 1027 different blocks accessed between your last access to block A and your current miss. Your block size is 64 bytes and you have a 32KB cache. What kind of miss was this? Select one: a. Capacity Miss b. Conflict Miss c. Compulsory Miss