A two-way set-associative cache has a total of 4 blocks and each block holds 1 word of data. For the following memory references, determine the final cache content assuming LRU (Least Recently Used) replacement policy is in use. Assume that the cache is initially empty; memory is word-addressable; and memory references are given in decimal. Memory References: 0, 1, 5, 10, 0, 34, 1, 21

A two-way set-associative cache has a total of 4 blocks and each block holds 1 word of data. For the following memory references, determine the final cache content assuming LRU (Least Recently Used) replacement policy is in use. Assume that the cache is initially empty; memory is word-addressable; and memory references are given in decimal. Memory References: 0, 1, 5, 10, 0, 34, 1, 21

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

A cache memory stores frequently/recently used data and instructions during instruction execution. With the aid of a diagram explain how the main memory is divided into blocks and how these blocks of main memory are allocated to the lines of cache using direct mapping.
Cache Performance Please answer the following questions regarding average memory access time (AMAT). a. If a specific cache design has 2% miss rate for a set of benchmarks with a hit latency of 20 cycles and a miss penalty of 200 cycles. What is the AMAT for this cache? b. If another cache design has 5% miss rate for the same set of benchmarks with a hit latency of 13 cycles and a miss penalty of 200 cycles. What is the AMAT for this cache? c. Which cache design is better?
architecture.
D Question 24 Assume the address format for a 2-way set-associative cache is as follows: 4 bits 2 bits 2 bits Tag Set Offset 8 bits Given the cache directory is as shown in the diagram below, indicate which cache set the memory reference Ox5E maps to (express set number in decimal) and whether it results in a cache hits or miss Copyright © 2016-2021 by A.Berrached-All Rights Reserved. Set Tag valid 00 1 10 01 1 1 10 11 Question 25 0000 1101 0000 0001 0000 1011 0101 1000 1 1 0
Table below shows the access time and accessed counter for each of the block inside a disk cache. Block Last Access Time Counter A 7/12/2021, 17:05:23 10 7/12/2021, 14:12:63 23 C 7/12/2021, 10:12:63 15 D 7/12/2021, 18:12:63 11 E 7/12/2021, 1:12:63 21 (a) Explain about Least Frequently Used (LFU) policy and state which block will be replaced if it is based on LFU. (b) Explain about Least Recently Used (LRU) policy and state which block will be replaced if it is based on LRU.
1. 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. 42, 137, 66, 50, 38, 225, 173, 22, 19, 88, 51, 43 a. For each of these references, identify the binary address, the tag, and the index given a direct mapped cache with 16 one-word blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. b. 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 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. Please explain the process.
. Cache Write Policies In a cache system using a write-back policy, if a cache block is modified and marked as "dirty" but not yet updated in the main memory, and that block is selected for replacement, what action should be taken to ensure data integrity?
Computer science question
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 1a) What is the number of cache lines? Question 1b) What is the total number of 'memory bitcells' that are needed to design this cache (note, this includes the bitcells required for the tags, valid and dirty bits).
P2
Question 4 Given a computer with a memory system having a30_bit address, a cache consisting of 1024 blocks each is 8 words. For the following cache types: Direct Mapped (DM), Fully_ associative (FA), Two_way set associative (2_way), Four_way set associative (4_way), Eight_way set associative (8_way), calculate the following values as specified. (Use paper and pencil to do needed calculations and write only the final answer in the given blank space). 1) 4_way: The size of the index field =Blank 1bits 2) 8_way: The size of the index field =Blank 2bits 3) DM: The size of the index field = Blank 3bits 4) 2_way: The size of the index field =Blank 4bits 5) The size of the offset field = Blank 5bits 6) 4_way: The size of the tag field =Blank 6bits 7) 8_way: The size of the tag field =Blank 7bits 8) DM: The size of the tag field =Blank 8bits 9) 2_way: The size of the tag field =Blank 9bits 10) FA: The size of the tag field =Blank 10bits
The low order 4 bits of the address indicate location in the cache line and the next 4 bits indicate which line in the cache should be used and the remaining bits of the address are used as the cache tag. If the following addresses are read in this order, indicate (circle or similar) each one that would result in a cache miss. 2A1220 2A122C B14408 B14428 2A122C