Among the three classes of cache misses, [ Select ] ["Cold miss", "Capacity miss", "Conflict miss"] is not affected if you enlarge cache size but keep block size and associativity constant.
Added by Kari L.
Step 1
The three classes are: - Cold miss (also known as a compulsory miss): This occurs when data is accessed for the first time and is not in the cache. - Capacity miss: This occurs when the cache cannot contain all the data needed for the program, leading to evictions Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 80 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Three caches, each containing 32 bytes, have the following specs: Each cache has a block size of 4 bytes. Cache A: direct-mapped. Cache B: 2-way set-associative. Cache C: 4-way set-associative. Assumptions: All caches are initially empty. The processor uses an LRU replacement policy. Data words are 32 bits wide. Addresses are 32 bits wide, and their lower bits are byte offsets (memory is byte addressed). How many offset, index, and tag bits are in Caches A, B, and C? 1. Cache A 2. Cache B 3. Cache C
Akash M.
Caching is used to serve stored data more efficiently. It is commonly used, particularly in large scale distributed systems, to allow the most frequently accessed information to be available at a lower cost in time or resources. Since cache capacity is limited, strategies are employed to determine what is in the cache and when it should be replaced. These are referred to as eviction policies and replacement policies. Which of the following are true? Pick ONE OR MORE options: A cache hit is a situation when the cache becomes full. LRU and MRU are eviction policies that respectively discard least recently used and most recently used elements from the cache to make space for other elements. In applications like social networks with feed, LRU, in general, performs significantly better than MRU. If the future is known, it is possible to design an eviction policy that is optimal. The data in a cache is always consistent with the changes made to it. Any time it is requested, the most recent version is returned.
Mauya M.
We will consider different cache design options, with address translation in consideration as well. Recall that for associative caches, the tag check must be completed before load results are returned to the CPU because the result of the tag check determines which cache way is selected. Consequently, the tag check is often on the critical path. If the cache uses a physical tag, that means the address translation (TLB lookup) should happen before tag lookup, adding more latency on the critical path. Assume a 4-way set-associative cache with 8-word (32-byte) cache lines. The address is 32 bits and byte-addressed. The data output is also 32 bits (1 word), and the MUX selects one word out of the eight words in a cache line. We reserve 2 bits for the status of each cache line. In order to avoid the synonym problem, we use a VIPT cache design. Consider a 4KB page, what is the largest number of cache sets that can be supported? What is the total size of the cache when we choose the largest number of cache sets?
Supreeta N.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD