2. Consider 2 level memory hierarchy made of L1 and L2 data caches. Assume that both caches use write back policy on write hit and both have the same block size. Write down the actions that would be taken when a n L1 Cache miss occurs.

2. Consider 2 level memory hierarchy made of L1 and L2 data caches. Assume that both caches use write back policy on write hit and both have the same block size. Write down the actions that would be taken when a n L1 Cache miss occurs.

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

Solve the cache problem for Direct Map. Cache holds 64 words, and a block size is 16 words. (5 pts for correct tag/index, 5 pts for correct cache set up # of blocks, 10pts for filling in cache correctly) Show each access being filled in with a note of hit or miss. You are given byte address and the access are: 0x3ff, 0x000, 0x200, 0x3f0, 0x009, 0x320, 0x32f.
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.
3.0 Caches are important to providing a high-performance memory hierarchy to processors. Below is a list of 32-bit hexadecimal memory addresses, given as byte addresses. 74, A0, 78, 38C, AC, 84, 88, 8C, 7C, 34, 38, 13C, 388, 18C 3.0.1 For each of these references, identify the index and the tag, given a direct-mapped cache with 8 one-word blocks. List if each reference is a hit or a miss, assuming the cache is initially empty and show every entry to the cache, including the tag value and the addresses of all data items stored. Use hexadecimal or binary, whichever is easier. 3.0.2 For each of these references, identify the index and the tag, given a direct-mapped cache with two word blocks and a total of 16 words. List if each reference is a hit or a miss, assuming the cache is initially empty and show every entry to the cache, including the tag value and the addresses of all data items stored. Use hexadecimal or binary, whichever is easier.
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.
Question i need help solving: Give the position (or set) in the cache that would be checked on each of the read operations of question 1, for each of the following caches. (a) direct-mapped cache with total capacity of 16 one-word blocks(b) direct-mapped cache with total capacity of 4 four-word blocks(c) 4-way set-associative cache with total capacity of 16 one-word blocks(d) 2-way set-associative cache with total capacity of 4 four-word blocks Question 1 my question is referring to (DO NOT SOLVE THIS ONE): Suppose that a program does read operations on the following memoryaddresses (e.g., with “lb” or “lw” instructions): 96, 508. Give the number of the memory block that each of these addresses belongs to, for each of the following memory block size. (a) block size of one word (4 bytes) my answer: 6031(b) block size of four words (16 bytes) my answer: 1 Please show you steps in solving the question. I want to understand how to solve it on my own