6. A cache has the following parameters: b, block size given in numbersof words; S, number of sets; N, number of ways;and A, number of页2address bits.A 16-word cache has the parameters given above.Consider the following repeating sequence of lw addresses (given inhexadecimal) and cache con.gurations:74 A0 78 38C AC 84 88 8C 7C 34 38 13C 388 18CThe cache capacity is still 16 words. Assuming least recently used(LRU) replacement for associative caches, determine the efectivemiss rate if the sequence is input to the following caches, ignoringstartup effects (i.e., compulsory misses)(1) two-way set associative cache, b = 2 words(2) direct mapped cache, b= 4 words

Here is the answer with an explanation:-

The cache capacity is still 16 words. Assuming least recently used (LRU) replacement for associative caches, determine the efective miss rate if the sequence is input to the following caches, ignoring startup effects (i.e., compulsory misses) (1) two-way set associative cache, b = 2 words (2) direct mapped cache, b= 4 words

The cache capacity is still 16 words. Assuming least recently used (LRU) replacement for associative caches, determine the efective miss rate if the sequence is input to the following caches, ignoring startup effects (i.e., compulsory misses) (1) two-way set associative cache, b = 2 words (2) direct mapped cache, b= 4 words

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

The average CPI for L1, L2 and L3 cache system with no miss is 1.0. L3 has a hit rate of 85%. L1 has a miss rate of 85% and L2 has a hit rate of R%. 1 cycle takes 0.45 ns. The miss penalty for L1 is 6 cycles, for L2 is 16 cycles and for L3 is 56 cycles. If the cache average access time is found to be 1.2 ns, evaluate the miss (b) rate of the L2 cache.
In a split L1 cache organization the I-cache size is 16-KB and the D-cache is 32-KB; the access time for both caches is 1 cycle. The miss rates are given in the table below. There is a 256KB second level cache (L2) that is a unified cache and has a miss rate given in the table. Please assume that miss penalty is 20 cycles to get data from L2 cache. There is a 4MB third level cache (L3) that has a latency of 42 cycles; its miss rate is 1.28%. 124 cycles are required to get data from main memory. A program executes 8.6×10° instructions; 32.8% of the executed instructions are data references (i.e. loads or stores). AMAT = Hit Time + Miss Rate x Miss Penalty Cache miss rates a) Please determine the AMAT for this memory system. [7 points] Cache Size L1 I-Cache L1 D-Cache L2 Unified Cache 8 KB 0.82% 12.21% 8.63% 16 KB 0.38% 11.36% 6.75% L1: I D 32 KB 0.14% 10.67% 5.18% 64 KB 0.06% 10.15% 4.89% L2: U_cache 128 KB 0.03% 9.81% 3.66% 256 KB 0.002% 9.06% 2.76% L3: U_cache M: Main
A byte offset of 2 in an address means that each set in a multiway set associative (or in the directly mapped) cache has 4 bytes per set, per cache line. Keeping this in mind, answer the questions given the following details. A cache is organized as a 4 way set associative cache Each set's cache line consists of 4 words (meaning there are 16 bytes per line, for each set of the cache). Each set individually has one Valid bit, and one Dirty bit, for each line. The tag field of this cache is 8 bits wide. The address is 32 bits wide. Question 1g) If we have a write through cache coherency policy, will either of the above organizations make a difference in the amount of power used to do one write through operation (specifically above this cache layer, in the upper level memory structures to maintain coherency.
Asap please
You have a K-Way set associative cache with following parameters Cache Data Size (C) Block Size (b) Blocks/Ways per set (K) After partitioning the address, which is 32 bits big, into Tag, Set, and Offset, how many bits will be in each field? Tag Bits per field [Select] Set ✓ [Select ] 1 W N 3 40960 8 5 4 Offset [Select]
Explain why it is difficult to devise a suitable cache replacement technique for all address sequences.
Please fast
Consider a 32 KB 4-way set associative cache organization with 512 B block size. The size of the physical memory is 256 KB. The number of tag bits required is
What are some of the reasons why it is difficult to create a cache replacement policy that is optimal for all address sequences?
Consider a 2-block fully associative cache. The following blocks from main memory are accessed which need to be mapped to cache: P, Q, P, R. Which block is replaced from the cache when the last block (block R) is accessed? Assume FIFO replacement policy.
Explain why it is difficult to devise a suitable cache replacement technique for all address sequences.
Given a 2-way set-associative cache with 2 entries (sets) and 1 byte block size (no offset), what is the LRU value of each entry (set) after the following processor access sequence? Assume the LRU bits of both entries are set to 0 initially. Processor accesses: 10000, 10001, 11101, 11011, 11110 LRU (entry 0) = _, LRU (entry 1) = O 1,0 O 0, 0 O 0, 1 O 1, 1