Suppose we have a memory and a 2-way set-associative cache with the following characteristics. Memory is byte addressable. Memory addresses are 16 bits. The cache has 64 lines and each cache line holds 8 bytes of data (a) Show the memory address format. Memory address (b) Given a sequence of four binary memory addresses in the order they are used to reference 0010 1101 1011 0011 memory, indicate whether that reference is a hit o010 1101 1011 1000 or a miss. Assume that the cache is initially empty. You need to show the calculation. 0110 1101 1011 0111 1010 1101 1011 1000
Suppose we have a memory and a 2-way set-associative cache with the following characteristics. Memory is byte addressable. Memory addresses are 16 bits. The cache has 64 lines and each cache line holds 8 bytes of data (a) Show the memory address format. Memory address (b) Given a sequence of four binary memory addresses in the order they are used to reference 0010 1101 1011 0011 memory, indicate whether that reference is a hit o010 1101 1011 1000 or a miss. Assume that the cache is initially empty. You need to show the calculation. 0110 1101 1011 0111 1010 1101 1011 1000
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...
Related questions
Question
2
Transcribed Image Text:Suppose we have a memory and a 2-way set-associative
cache with the following characteristics.
Memory is byte addressable. Memory addresses are 16 bits.
The cache has 64 lines and each cache line holds 8 bytes of
data
(a) Show the memory address format.
Memory address
(b) Given a sequence of four binary memory
addresses in the order they are used to reference 0010 1101 1011 0011
memory, indicate whether that reference is a hit
or a miss. Assume that the cache is initially empty.
You need to show the calculation.
0010 1101 1011 1000
0110 1101 1011 0111
1010 1101 1011 1000
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY