6-3

.pdf

School

University of Massachusetts, Amherst *

*We aren’t endorsed by this school

Course

230

Subject

Computer Science

Date

Jul 1, 2024

Type

pdf

Pages

2

Uploaded by MajorTank837

4/29/24, 3 : 01 AM Lesson 3, Cache Replacement (LESSON QUIZ): Attempt review Page 1 of 2 https://umass.moonami.com/mod/quiz/review.php ? attempt=2891510&cmid=2293072 Question 1 Correct 2.00 points out of 2.00 Question 2 Correct 2.00 points out of 2.00 Question 3 Correct 2.00 points out of 2.00 Started on Sunday, March 24, 2024, 8 : 21 PM State Finished Completed on Sunday, March 24, 2024, 8 : 21 PM Time taken 23 secs Grade 10.00 out of 10.00 ( 100 %) A = [4, 1, 4, 3, 4, 1, 3, 2] Suppose A, a list of address requests. We execute those requests starting with the request at index 0 in the list. We are using the Least Frequently Used replacement policy to cache those request. The capacity of the cache is 2 addresses. If there is a tie, the smallest number is removed. For example if both 2, 3 and 4 have a frequency of 1, then 2 is removed. The final values in the cache is 4 and 3. Select one: True False Least Frequently Used (LFU) Count how often an entry is used by incrementing a counter associated with each entry in the cache. Remove the entry with the least frequently used counter first. Request Pattern: Discard entries that are not needed over the longest period. Select one: True False Belady’s Algorithm: Replace the data that will not be used for the longest period of time in the future. Select one: True False
4/29/24, 3 : 01 AM Lesson 3, Cache Replacement (LESSON QUIZ): Attempt review Page 2 of 2 https://umass.moonami.com/mod/quiz/review.php ? attempt=2891510&cmid=2293072 Question 4 Correct 2.00 points out of 2.00 Question 5 Correct 2.00 points out of 2.00 Least Recently Used (LRU) New items are placed in the top of the cache. When cache exceeds size limit, discard items from the bottom. Remove the least recently used item first Request Pattern: Discard entries that are least recently used. Select one: True False A = [4, 1, 4, 3, 4, 1, 3, 2] Suppose A, a list of address requests. We execute those requests starting with the request at index 0 in the list. We are using the Least Recently Used replacement policy to cache those request. The capacity of the cache is 2 addresses. The final values in the cache is 2 and 3. Select one: True False Lesson 3, Cache Replacement (SLIDES) Jump to... Week 6 Worksheet
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help