n left LL D 1 2 3 1. Minimum Cache Capacity Given a list of n items accessed in sequence from a system, and a cache with Least Recently Used (LRU) replacement policy, the goal is to determine the minimum cache size required to ensure at least k requests hit the cache. If it is not possible to achieve k hits, return -1. Assume each item in the list has a size of 1 unit. Note: A cache following Least Recently Used (LRU) replacement policy is of fixed size and when it becomes full we will delete the value which is least recently used and insert a new value. Example Suppose n = 5, requests = ["item1", "item1", "item3", "item1", "item3"], and k = 1. 4 With size of cache as 1, we get:

For each of the cache modifications that we could perform, select whether it will increase, decrease, have no effect, or have an unknown effect on the parameter. • An unknown effect means that it could either decrease or increase the parameter in question. • No effect also includes marginal or very little effect . • When answering for multilevel caching, answer based on the caching system as a whole. Improvement Increase Cache Size (C) Increase Associativity(K) Increase Block Size(b) Use Multilevel Caching Hit Rate [Select] [Select] [Select] [Select] V Cache Access Time [Select] [Select] V [Select] [Select] V Average Memory Access Time [Select] [Select] [Select] [Select] <

Please provide explanation.

For each of the following overhead bits, select whether there are these bits per cache, per set, per block, or per value. • Assume the cache is a K-way set associative cache. Valid Bit Dirty Bit Tag Bits Counter if using FIFO replacement policy Counters if using LRU replacement policy Instance Per [Select] Cache Set Block Value Tecret [Select] [Select]

2-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. a. 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 4 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. 42, 180, 46, 185, 189, 3, 181, 43, 6, 189, 65, 190 b. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with four-word blocks and a total size of 4 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. c. For each of these references, identify the binary address, the tag, and the index given a two way associative cache with two-word blocks and a total size of 4 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty d. For each of these…

Cache replacement policies are necessary: O to determine which block in cache should be the victim block. to determinc which cache mapping policy to use. O All of these are correct. O to decide where to put blocks when cache is empty.

To what extent may a certain log processing function access the various components of a log entry? The following code determines the median number of cache misses per entry while using 64-byte cache blocks and no prefetching.

CSC 472 Introduction to Database Systems Project Consider the CLOCK page replacement policy. Assume that there are only 3 page slots available in the buffer pool. If a page reference sequence is: 0, 4, 1, 4, 2, 4, 3, 4 (in order from left to right). What happens when the second 4 (i.e., the 4 underlined with blue color) is referenced? Group of answer choices Its reference bit is set to 1. Its reference bit is set to 0. It is evicted. Nothing changes.

Caching data may improve performance by taking use of "spatial locality" and "temporal locality." Caches employ these two occurrences in many ways.

The padding technique is effective to remove false sharing, but it requires consuming more memory in order to fill in the first cache line to enforce y to move to another cache line. If the memory consumption is a concern, what would you suggest as an alternative possible solution the programmer can do to avoid false sharing?