CACHE - SHOW YOUR WORK (Part A) Design a 512KB (note big B) direct-mapped data cache that uses a 32-bit address/data and 8 words per block. Calculate the following: (a) How many bits are used for the byte offset? (b) How many bits are used for the block offset? (c) How many bits are used for the set (index) field? (d) How many bits are used for the tag? (e) What is the physical size of the cache (show as bits/row * # of rows, x * 2v)?

CACHE - SHOW YOUR WORK (Part A) Design a 512KB (note big B) direct-mapped data cache that uses a 32-bit address/data and 8 words per block. Calculate the following: (a) How many bits are used for the byte offset? (b) How many bits are used for the block offset? (c) How many bits are used for the set (index) field? (d) How many bits are used for the tag? (e) What is the physical size of the cache (show as bits/row * # of rows, x * 2v)?

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

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.
Determine which bits in a 32-bit address are used for selecting the byte (B), selecting the word (W), indexing the cache (I), and the cache tag (T), for each of the following caches: B. 256-line, fully-associative, write back, 16 byte line
Consider a 64K L2 memory and a 4K L1 2-way associative cache with block sizes of 512. a. How many blocks are in each set in L1? b. How many offset bits are in the L2 address? c. How many index bits are in the L2 address? d. How many tag bits are in the L2 address?
A cache has been designed such that it has 512 lines, with each line or block containing 8 words. Identify the line number, tag, and word position for the 20- bit address 3A45616 using the direct mapping method.
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).
QUESTION THREE (4) (a) Explain what is the function of buffer. (b) Give THREE (3) advantages of cache work with the buffer for data transfer. (c) What is "bus-snooping" used for.
Consider a direct-mapped cache with 2 MB data 16-word block and 32-bit addressing. a Find the number of tag bits, index bits, and offset bits in a 32-bit that is byte addressed.
A computer is using a fully associative cache and has 216 bytes of main memory (byte addressable) and a cache of 64 blocks, where each block contains 32 bytes. a. How many blocks of main memory are there? b. What will be the sizes of the tag, index, and byte offset fields? c. To which cache set will the memory address 0xF8C9(hexadecimal) map?
Consider a cache with 128 blocks. The block size is 32 bytes. Find the number of tag bits, index bits, and offset bits in a 32-bit address if you design it as a) Direct-mapped b) 8-way Set Associative
Assume that you have a direct-mapped cache with 16 indices and each block can contain 32 words. Assuming that each bytes address is 32 bits long (and a word is 32 bits), answer the following questions: a). How many bits in each address are used for its tag? bits b). Compute the total number of bits required to implement this cache, including valid bits, tag bits and bits used for data. bits