Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Cache system B represents a 2-way set-associative mapping cache system in table 2 The system is byte-addressable and the block size is one word (4 bytes). The tag and set numbers are represented with binary numbers. The contents of words in a block are represented with hexadecimal. Tag 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 Table 2 1. What is the size of the main memory for the Cache system B? Answer= 2. What is the size of the cache memory of Cache system B? Answer= Answer= Answer= 16 Answer= Set Number 16 1011 0110 1101 1011 0110 1101 miss(es) 1011 0110 1110 1011 0110 1110 1011 0110 1111 1011 0110 1111 1011 0111 0000 3. If we request to read memory address F1 24 2D B7, what data do we get? 1011 0111 0000 1011 0111 0001 1011 0111 0001 4. If we request to read memory address A1 24 2D B4, what data do we get? 1011 0111 0010 1011 0111 0010 Word within block 00 2016 2116 2316 2316 2416 2516 2616 2716 2816 2916 2A16 2B16 01 3016 3116 3316 3316 3416 3516 3616 3716 3816 3916 3A16 3B16 10 4016 4116 4316 4316 4416 4516 4616 4716 4816 4916 4A16 4B16 11 5016 5116 5316 5316 5416 5516 5616 5716 5816 5916 5A16 5. If we access memory in the following order in the Cache system B, how many Cache misses would occur for this data request? Assume for this question that the cache locations referenced are empty to start with Memory addresses: 1. A1 A1 FF B1 2. F1 A1 FF B2 3. A1 A1 FF B3 4. F1 A1 FF B3 5. A1 A1 FF BO 5B16

Cache system B represents a 2-way set-associative mapping cache system in table 2 The system is byte-addressable and the block size is one word (4 bytes). The tag and set numbers are represented with binary numbers. The contents of words in a block are represented with hexadecimal. Tag 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 Table 2 1. What is the size of the main memory for the Cache system B? Answer= 2. What is the size of the cache memory of Cache system B? Answer= Answer= Answer= 16 Answer= Set Number 16 1011 0110 1101 1011 0110 1101 miss(es) 1011 0110 1110 1011 0110 1110 1011 0110 1111 1011 0110 1111 1011 0111 0000 3. If we request to read memory address F1 24 2D B7, what data do we get? 1011 0111 0000 1011 0111 0001 1011 0111 0001 4. If we request to read memory address A1 24 2D B4, what data do we get? 1011 0111 0010 1011 0111 0010 Word within block 00 2016 2116 2316 2316 2416 2516 2616 2716 2816 2916 2A16 2B16 01 3016 3116 3316 3316 3416 3516 3616 3716 3816 3916 3A16 3B16 10 4016 4116 4316 4316 4416 4516 4616 4716 4816 4916 4A16 4B16 11 5016 5116 5316 5316 5416 5516 5616 5716 5816 5916 5A16 5. If we access memory in the following order in the Cache system B, how many Cache misses would occur for this data request? Assume for this question that the cache locations referenced are empty to start with Memory addresses: 1. A1 A1 FF B1 2. F1 A1 FF B2 3. A1 A1 FF B3 4. F1 A1 FF B3 5. A1 A1 FF BO 5B16

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
Cache system B represents a 2-way set-associative mapping cache system in table 2 The system is byte-addressable and the block size is one word (4 bytes). The tag and set numbers are represented with binary numbers. The contents of words in a block are represented with hexadecimal. Tag 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 Table 2 1. What is the size of the main memory for the Cache system B? Answer= 2. What is the size of the cache memory of Cache system B? Answer = Answer= Answer = 16 Answer = Set Number 16 1011 0110 1101 1011 0110 1101 miss(es) 1011 0110 1110 1011 0110 1110 1011 0110 1111 1011 0110 1111 1011 0111 0000 3. If we request to read memory address F1 24 2D B7, what data do we get? 1011 0111 0000 1011 0111 0001 1011 0111 0001 4. If we request to read memory address A1 24 2D B4, what data do we get? 1011 0111 0010 1011 0111 0010 Word within block 00 2016 2116 2316 2316 2416 2516 2616 2716 2816 2916 2A16 2B16 01 3016 3116 3316 3316 3416 3516 3616 3716 3816 3916 3A16 3B16 10 4016 4116 4316 4316 4416 4516 4616 4716 4816 4916 4A16 4B16 11 5016 5116 5316 5316 5416 5516 5616 5716 5816 5916 5A16 5. If we access memory in the following order in the Cache system B, how many Cache misses would occur for this data request? Assume for this question that the cache locations referenced are empty to start with. Memory addresses: 1. A1 A1 FF B1 2. F1 A1 FF B2 3. A1 A1 FF B3 4. F1 A1 FF B3 5. A1 A1 FF BO 5B16
Transcribed Image Text:Cache system B represents a 2-way set-associative mapping cache system in table 2 The system is byte-addressable and the block size is one word (4 bytes). The tag and set numbers are represented with binary numbers. The contents of words in a block are represented with hexadecimal. Tag 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 10 1000 0100 1001 0000 11 1100 0100 1001 0000 Table 2 1. What is the size of the main memory for the Cache system B? Answer= 2. What is the size of the cache memory of Cache system B? Answer = Answer= Answer = 16 Answer = Set Number 16 1011 0110 1101 1011 0110 1101 miss(es) 1011 0110 1110 1011 0110 1110 1011 0110 1111 1011 0110 1111 1011 0111 0000 3. If we request to read memory address F1 24 2D B7, what data do we get? 1011 0111 0000 1011 0111 0001 1011 0111 0001 4. If we request to read memory address A1 24 2D B4, what data do we get? 1011 0111 0010 1011 0111 0010 Word within block 00 2016 2116 2316 2316 2416 2516 2616 2716 2816 2916 2A16 2B16 01 3016 3116 3316 3316 3416 3516 3616 3716 3816 3916 3A16 3B16 10 4016 4116 4316 4316 4416 4516 4616 4716 4816 4916 4A16 4B16 11 5016 5116 5316 5316 5416 5516 5616 5716 5816 5916 5A16 5. If we access memory in the following order in the Cache system B, how many Cache misses would occur for this data request? Assume for this question that the cache locations referenced are empty to start with. Memory addresses: 1. A1 A1 FF B1 2. F1 A1 FF B2 3. A1 A1 FF B3 4. F1 A1 FF B3 5. A1 A1 FF BO 5B16
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of Database Architectures
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS