Address of Contents of Cache Blocks After Reference Memory Evicted Block Accessed Hit or Miss Block Set o Set 0 Set 1 Set 1 Miss Mem[0] 1 Miss Mem[0] Mem[1) Miss Mem[0] Mem[2) Mem[1] 3 Miss Mem[0] Mem[2] Mem[1] Mem[3] 4 Miss Mem[4] Mem[2] Mem[1] Mem[3] ...

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

In this exercise, we will examine how replacement policies impact miss rate. Assume a 2-way set associative cache with 4 blocks. To solve the problems in this exercise, you may find it helpful to draw a table like the one below, as demonstrated for the address sequence “0, 1, 2, 3, 4.”


Consider the following address sequence: 0, 2, 4, 8, 10, 12, 14, 16, 0
Assuming an LRU replacement policy, how many hits does this address sequence exhibit?
Assuming an MRU (most recently used) replacement policy, how many hits does this address sequence exhibit?
Simulate a random replacement policy by flipping a coin. For example, “heads” means to evict the fi rst block in a set and “tails” means to evict the second block in a set. How many hits does this address sequence exhibit?
Which address should be evicted at each replacement to maximize the number of hits? How many hits does this address sequence exhibit if you follow this “optimal” policy?
Describe why it is diffi cult to implement a cache replacement policy that is optimal for all address sequences.
Assume you could make a decision upon each memory reference whether or not you want the requested address to be cached. What impact could this have on miss rate?


Address of
Contents of Cache Blocks After Reference
Memory
Evicted
Block Accessed
Hit or Miss
Block
Set o
Set 0
Set 1
Set 1
Miss
Mem[0]
1
Miss
Mem[0]
Mem[1)
Miss
Mem[0]
Mem[2)
Mem[1]
3
Miss
Mem[0]
Mem[2]
Mem[1]
Mem[3]
4
Miss
Mem[4]
Mem[2]
Mem[1]
Mem[3]
...
Transcribed Image Text:Address of Contents of Cache Blocks After Reference Memory Evicted Block Accessed Hit or Miss Block Set o Set 0 Set 1 Set 1 Miss Mem[0] 1 Miss Mem[0] Mem[1) Miss Mem[0] Mem[2) Mem[1] 3 Miss Mem[0] Mem[2] Mem[1] Mem[3] 4 Miss Mem[4] Mem[2] Mem[1] Mem[3] ...
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY