1. A byte-addressable computer has a small data cache capable of holding eight 32-bit words. Each cache block consists of one 32-bit word. When a given program is executed, the processor reads data sequentially from the following hex addresses: 494, 4A4, 484, 49C, 4B8, 494, 4C0, 4C0 a. Assume that the cache initially contains. 0 1 2345 6 7 4A04A4 4A8 48C 490 494 4B849C Show the contents of the cache at the end of each pass through the loop if a direct-mapped cache is used and compute the hit rate. b. Repeat part (a) for a two-way set-associative cache, with initial contents. 0 1 2 3 4A01490494 14B44A8r4B8 48C 149C

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
Computer science
1. A byte-addressable computer has a small data cache capable of holding eight 32-bit words. Each cache
block consists of one 32-bit word. When a given program is executed, the processor reads data sequentially
from the following hex addresses:
494, 4A4, 484, 49C, 4B8, 494, 4C0, 4C0
a. Assume that the cache initially contains.
0
1 2
3 4 5 6 7
4A04A44A8 48C 490 494 4B849C
Show the contents of the cache at the end of each pass through the loop if a direct-mapped cache is
used and compute the hit rate.
b. Repeat part (a) for a two-way set-associative cache, with initial contents.
0
1
2
3
4A0 1490 494 14B44A8r4B8 48C 149C
Transcribed Image Text:1. A byte-addressable computer has a small data cache capable of holding eight 32-bit words. Each cache block consists of one 32-bit word. When a given program is executed, the processor reads data sequentially from the following hex addresses: 494, 4A4, 484, 49C, 4B8, 494, 4C0, 4C0 a. Assume that the cache initially contains. 0 1 2 3 4 5 6 7 4A04A44A8 48C 490 494 4B849C Show the contents of the cache at the end of each pass through the loop if a direct-mapped cache is used and compute the hit rate. b. Repeat part (a) for a two-way set-associative cache, with initial contents. 0 1 2 3 4A0 1490 494 14B44A8r4B8 48C 149C
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

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