A byte-addressable system with 16-bit addresses ships with a three-way set associative, write-back cache (i.e., each block needs a dirty bit). The cache implements a true LRU replacement policy using the minimum number of replacement policy bits necessary to implement it, which means it requires 3 bits per set. The tag store requires a total of 264 bits of storage. What is the block size of the cache? (Hint: 264 28+23 and please also do not forget that aside from the tag itself, each block needs 1 valid bit, 1 dirty bit). =

A byte-addressable system with 16-bit addresses ships with a three-way set associative, write-back cache (i.e., each block needs a dirty bit). The cache implements a true LRU replacement policy using the minimum number of replacement policy bits necessary to implement it, which means it requires 3 bits per set. The tag store requires a total of 264 bits of storage. What is the block size of the cache? (Hint: 264 28+23 and please also do not forget that aside from the tag itself, each block needs 1 valid bit, 1 dirty bit). =

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 phrases "unified cache" and "Hadley cache" should be defined.
A byte-addressable system with 16-bit addresses ships with a three-way set associative, write-backcache (i.e., each block needs a dirty bit). The cache implements a true LRU replacement policy usingthe minimum number of replacement policy bits necessary to implement it, which means it requires 3bits per set. The tag store requires a total of 264 bits of storage. What is the block size of the cache?(Hint: 264 = 2^8 + 2^3 and please also do not forget that aside from the tag itself, each block needs 1valid bit, 1 dirty bit).
Suppose a computer using direct mapped cache has 236 bytes of byte-addressable main memory and a cache size of 1024 bytes, and each cache block contains 64 bytes. ⦁ How many blocks of main memory are there? ⦁ What is the format of a memory address as seen by cache, i.e., what are the sizes of the tag, block, and offset fields? ⦁ To which cache block will the memory address 0x13A4576B map?
In a certain computer, the virtual addresses are 32 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 16 kB and the word size is 2 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 64 valid entries. Hit ratio of TLB is 100% then maximum number of distinct virtual addresses that can be translated is K.
Assume the address format for a fully-associative cache is as follows: 6 bits 2 bits Tag Offset 8 bits Given the cache directory is as shown in the diagram below, indicate whether the memory reference Ox5E results in a cache hits or a miss. Tag valid Block 000 110110 001 000001 010 000010 011 000101 100 001000 1 101 100010 110 010111 111 110110 O Hit O Miss
Suppose we have a byte-addressable computer with a cache that holds 8 blocks of 16 bytes each. Assuming that each memory address has 16 bits, to which cache block would the hexadecimal address 0x13F map if the computer uses direct mapping? Blocks are numbered starting at 0.
Question 4
A 2-way set associative cache consists of four sets. Main memory contains 2K blocks of eight words each. Show the main memory address format that allows us to map addresses from main memory to cache. Be sure to include the fields as well as their sizes. Compute the hit ratio for a program that loops 6 times from locations 8 to 51 in main memory. You may leave the hit ratio in terms of a fraction. Please show details how you obtain the result.
Consider a 32-bit physical memory space and a 32 KiB 2-way associative cache with LRU replacement. You are told the cache uses 5 bits for the offset field. Write in the number of bits in the tag and index fields. Tag length in bits = Index length in bits =
A fully associative cache is different from a directly mapped cache in that it allows users to arbitrarily associate data items. Isn't this capability the main differentiator between the two cache types?