Question 3 (Cache Memory Mapping): I(a) For the main memory address 0:0:0, briefly explain how a search is performed in two-way setassociative mapping. Assume that the main memory size is 4 GB, the cache memory is 8 KB and the sizeof cache block is 32 bytes.(b) A 4-way set associative mapped cache consists of 64 blocks, divided into 4 sets. Main memory consistsof 4K blocks, each containing 128 locations. Complete the following format for the main memory addressby showing all your workings and find the tag size. [Hint: Calculate the no. of locations in the main memory,which gives the memory size in terms of the total number of bits] ,Set No.Block No.Location Within BlockNo. of bits

ANSWER: Cache Memory Mapping: Reserve Memory is an exceptional extremely fast memory. Reserve memory…

Answered: Question 3 (Cache Memory Mapping): I

Engineering

Computer Science

Question 3 (Cache Memory Mapping): I

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

3) Assume that there is a cache with 4 blocks and the block size is 1 byte (in total only 4B cache). The cache is initially empty. For two different configurations of the cache; direct-mapped and 2-way set associative, given memory addresses are accessed in the given order. Write if given addresses are hit or miss in the cache. address: 3 - 11 - 0 - 3 - 11
Consider the following list of memory address references. These memory accesses are cached in a cache that has 8 blocks where each block size is two words (2 x 4 bytes). The cache uses direct mapped placement. 0x03, 0xb4, 0x2b, 0x02, 0xbf, 0x58, 0xbe, 0x0e, 0xb5, 0x2c, 0xba, 0xfd a. For each of these references, identify the tag and index field values. b. For each of the references above, identify if each reference is a hit or a miss, assuming the cache is initially empty.
Here is the question: A direct-mapped cache consists of 8 blocks. A byte-addressable main memory contains 4K blocks of eight bytes each. Access time for the cache is 20 ns and the time required to fill a cache slot from main memory is 300 ns. Assume a request is always started in sequential to cache and then to main memory. If a block is missing from cache, the entire block is brought into the cache and the access is restarted. Initially, the cache is empty. b) Compute the hit ratio for a program that loops 3 times from address 0 to 75 (base 10) in memory. For b, another example has been provided in regards to a previous problem: A direct-mapped cache consists of eight blocks. Main memory contains 4K blocks of eight words each. Access time for the cache is 22 ns and the time required to fill a cache slot from main memory is 300ns (this time will allow us to determine the block is missing and bring it into cache). Assume a request is always started in parallel to both cache and to…
Please explain this 1,2, and 3 Consider following cache elements Cache can hold 64 kB Data are transferred between main memory and the cache in blocks of 16 bytes each Main memory consists of 16 MB For the hexadecimal main memory address 987654, show the following information (in hexadecimal format) 1.Tag, Line, and Offset(word) values for Direct-mapped Cache 2.Tag and Offset(Word) values for Associative Cache 3.Tag, Set, and Offset(word) values for aa 4-way Set-associative Cache
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.
6 Recall that we have two write policies and two 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 6.1 Buffers are employed between different levels of memory hierarchy to reduce access latency. For this given configuration, list the possible buffers needed between L1 and L2 caches, as well as L2 cache and memory. 6.2 Describe the procedure of handling an L1 write-miss, considering the components involved and the possibility of replacing a dirty block. 6.3 For a multilevel exclusive cache con guration (a block can only reside in one of the L1 and L2 caches), describe the procedures of handling an L1 write-miss and an L1 read-miss, considering the components involved and the possibility of replacing a dirty block.
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.
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.
If we have to design a 4 - way set - associative cache of 8 MB size that could work for a main memory of size 4 GB , determine the following : 1. The total number of cache locations 2. The size of tag Consider the cache block size as 4 bytes . Note:- Here he want the number of cache locations And, the size of tag show all the steps.
Question 1 Consider a memory system that uses a 32-bit address at the byte level, plus a cache that uses a 64-byte line size. a)Assume a direct mapped cache with a tag field in the address of 20 bits. Show the address format and determine the following parameters: number of addressable units, number of blocks in main memory, number of lines in cache, size of tag b) Assume an associative cache. Show the address format and determine the following parameters: number of addressable units, number of blocks in main memory, number of lines in cache, size of tag. c) Assume a four-way set-associative cache with a tag field in the address of 9 bits. Show the address format and determine the following parameters: number of addressable units, number of blocks in main memory, number of lines in set, number of sets in cache, number of lines in cache, size of tag.
Q.A direct-mapped cache consists of 8 blocks. Byte-addressable main memory contains 4K blocks of 8 bytes each. Access time for the cache is 22ns, and the time required to fill a cache slot from main memory is 300ns. (This time allows us to determine that the block is missing and bring it into cache.) Assume that a request is always started in parallel to both cache and to main memory (so if it is not found in cache, we do not have to add this cache search time to the memory access). If a block is missing from cache, the entire block is brought into the cache and the access is restarted. Initially, the cache is empty.Q.) Compute the hit ratio for a program that loops four times from addresses 0x0 to 0x43 in memory.
Q.A direct-mapped cache consists of 8 blocks. Byte-addressable main memory contains 4K blocks of 8 bytes each. Access time for the cache is 22ns, and the time required to fill a cache slot from main memory is 300ns. (This time allows us to determine that the block is missing and bring it into cache.) Assume that a request is always started in parallel to both cache and to main memory (so if it is not found in cache, we do not have to add this cache search time to the memory access). If a block is missing from cache, the entire block is brought into the cache and the access is restarted. Initially, the cache is empty.Q.) Show the main memory address format, which allows us to map addresses from main memory to cache. Be sure to include the fields as well as their sizes.