5.2.2 [10] <§5.3> For each of these references, identify the binary address, the tag, and the index given a direct- mapped cache with two-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. 8 Cache Spaces Index = 3 Bits %D Offset = 1 Address Ref Binary Address Tag Index 2^2 Offset н/м 3 0000 0011 0000 001 180 1011 0100 1011 010 43 0010 1011 0010 101 2 0000 0010 0000 001 Н 191 1011 1111 1011 111 1 88 0101 1000 0101 100 190 1011 1110 1011 111 Н 14 0000 1110 0000 111 181 1011 0101 1011 010 1 Н 44 0010 1100 0010 110 186 1011 1010 1011 101 253 1111 1101 1111 110
5.2.2 [10] <§5.3> For each of these references, identify the binary address, the tag, and the index given a direct- mapped cache with two-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. 8 Cache Spaces Index = 3 Bits %D Offset = 1 Address Ref Binary Address Tag Index 2^2 Offset н/м 3 0000 0011 0000 001 180 1011 0100 1011 010 43 0010 1011 0010 101 2 0000 0010 0000 001 Н 191 1011 1111 1011 111 1 88 0101 1000 0101 100 190 1011 1110 1011 111 Н 14 0000 1110 0000 111 181 1011 0101 1011 010 1 Н 44 0010 1100 0010 110 186 1011 1010 1011 101 253 1111 1101 1111 110
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
Hi,
For this question I was curious about the Hit/Miss. There are people saying that the third hit "181" is a miss and not a hit, but I dont know why. Can someone please explain?
![5.2.2 [10] <§5.3> For each of these references, identify the binary address, the tag, and the index given a direct-
mapped cache with two-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss,
assuming the cache is initially empty.
8 Cache Spaces
Index = 3 Bits
%D
Offset = 1
Address Ref
Binary Address
Tag
Index 2^2
Offset
н/м
3
0000 0011
0000
001
180
1011 0100
1011
010
43
0010 1011
0010
101
2
0000 0010
0000
001
Н
191
1011 1111
1011
111
1
88
0101 1000
0101
100
190
1011 1110
1011
111
Н
14
0000 1110
0000
111
181
1011 0101
1011
010
1
Н
44
0010 1100
0010
110
186
1011 1010
1011
101
253
1111 1101
1111
110](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F746016c5-067e-4e33-b522-e2c992274710%2Fe1d75c6e-683f-4bd8-b1f7-0bf2f50100d6%2Fk7azzs.png&w=3840&q=75)
Transcribed Image Text:5.2.2 [10] <§5.3> For each of these references, identify the binary address, the tag, and the index given a direct-
mapped cache with two-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss,
assuming the cache is initially empty.
8 Cache Spaces
Index = 3 Bits
%D
Offset = 1
Address Ref
Binary Address
Tag
Index 2^2
Offset
н/м
3
0000 0011
0000
001
180
1011 0100
1011
010
43
0010 1011
0010
101
2
0000 0010
0000
001
Н
191
1011 1111
1011
111
1
88
0101 1000
0101
100
190
1011 1110
1011
111
Н
14
0000 1110
0000
111
181
1011 0101
1011
010
1
Н
44
0010 1100
0010
110
186
1011 1010
1011
101
253
1111 1101
1111
110
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education