Discuss any 2 cache optimization that help reduce cache average memory access time
Added by Andrew C.
Step 1
Let's think step by step. Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 57 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
2. A 2-way set associative cache system consists of 8 blocks. The main memory has 2048 blocks of 16 bytes each (byte addressable). The access time of the cache is 20 ns, and the time required to fill a cache block is 600 ns. Note that the method Load Through is used. Initially, the cache is empty. Assume that the least recently used (LRU) replacement algorithm is used. (a) Show the format of the memory address. (b) The computer will execute a program that loops 20 times from locations (addresses) 15 to 129. Complete Table 2 for the program executed for the first loop. (c) Compute the cache hit rate and the effective memory access time when running the program mentioned in Part (b).
Akash M.
Q2 . Answer the following questions. [8 MARKS] A. A company named CacheFul is designing a machine with a byte addressable main memory. The size of the main memory is 2^18 Bytes and block size is 16 Bytes. The machine employs a direct mapping cache consisting of 32 lines. This machine is specifically configured to run a classification algorithm. i. When the algorithm is run it is noted that a memory access to main memory on a cache "miss" takes 30 ns and memory access to the cache on a cache "hit" takes 3 ns. If 80% of the processor's memory requests result in a cache "hit", how much time does it take to access memory on average? [1.5] ii. Recommended average memory access time for the algorithm to perform optimally is not more than 5 ns, what option as a developer, do you have to keep it near to 5ns? [1.5] B. Scientists at Indian Science Research Institute, wanted to check whether implementing cache replacement using two existing cache memory replacement algorithm LFU and FIFO would help reducing miss rate. The proposed new algorithm would work in two phases. The first 6 clocks (0-5) follow LFU and next 6 clocks (6-11) follow FIFO. The main memory block sequence is 0, 4, 0, 2, 1, 5, 0, 1, 2, 5, 0, 2 i. What is the Hit Ratio for the proposed new replacement algorithm? Justify your answer by filling in the following table. In LFU, in case of tie between cache lines for replacement, select the line which has been there for longer time in the cache. [4] ii. A hit ratio of 7/12 and 6/12 is achieved if LFU and FIFO replacement algorithms respectively are used. Scientists at Indian Science Research Institute would want you recommend appropriate replacement algorithm out of three schemes (LFU, FIFO and Proposed new scheme specified in part (i) ) with proper justification. [1]
Supreeta N.
How does reducing the frequency of TLB misses improves the overall system performance
Jake K.
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