3. The following data constitutes a stream of virtual addresses as seen on a system:1793, 5632, 7168, and 5089. Assume 1 KB pages, a 2-entry fully associative TLB, and true LRU replacement denoted by a bit called LRU where LRU bit 1 signifies most recently used entry. If pages must be brought in from disk, increment the next largest page number. Following are the binary representation of the virtual addresses: 1793 → 11100000001 5632 → 1011000000000 (20 points) 7168 → 1110000000000 5089 → 1001111100001 a) Given the address stream mentioned above, and the initial TLB and Page Table states provided below, show the different states of the TLB as the address are referenced in the table provided. List for each reference if it is a hit in the TLB, a hit in the page table, or a page fault in the relevant field. Page Table PP or Disk Disk Valid TLB 1 8 Valid Tag PPN LRU Disk 1 1 1 1 1 4 1 6 Disk 1 2 VA VPN PPN H/M TLB TLB TLB TLB Valid Tag PPN LRU 1793 5632 7168 5089

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
icon
Related questions
Question

Please fill the table

3. The following data constitutes a stream of virtual addresses as seen on a system:1793, 5632, 7168, and 5089.
Assume 1 KB pages, a 2-entry fully associative TLB, and true LRU replacement denoted by a bit called LRU
where LRU bit 1 signifies most recently used entry. If pages must be brought in from disk, increment the next
largest page number. Following are the binary representation of the virtual addresses:
(20 points)
1793 → 11100000001
5632 → 1011000000000
7168 → 1110000000000
5089 → 1001111100001
a) Given the address stream mentioned above, and the initial TLB and Page Table states provided below, show
the different states of the TLB as the address are referenced in the table provided. List for each reference if it is
a hit in the TLB, a hit in the page table, or a page fault in the relevant field.
Page Table
Valid
PP or Disk
Disk
TLB
1
8
Valid
Tag
PPN
LRU
Disk
1
1
8
1
1
9
1
4
1
6
Disk
1
2
VA
VPN
PPN
H/M
TLB
TLB
TLB
TLB
Valid
Tag
PPN
LRU
1793
5632
7168
5089
Transcribed Image Text:3. The following data constitutes a stream of virtual addresses as seen on a system:1793, 5632, 7168, and 5089. Assume 1 KB pages, a 2-entry fully associative TLB, and true LRU replacement denoted by a bit called LRU where LRU bit 1 signifies most recently used entry. If pages must be brought in from disk, increment the next largest page number. Following are the binary representation of the virtual addresses: (20 points) 1793 → 11100000001 5632 → 1011000000000 7168 → 1110000000000 5089 → 1001111100001 a) Given the address stream mentioned above, and the initial TLB and Page Table states provided below, show the different states of the TLB as the address are referenced in the table provided. List for each reference if it is a hit in the TLB, a hit in the page table, or a page fault in the relevant field. Page Table Valid PP or Disk Disk TLB 1 8 Valid Tag PPN LRU Disk 1 1 8 1 1 9 1 4 1 6 Disk 1 2 VA VPN PPN H/M TLB TLB TLB TLB Valid Tag PPN LRU 1793 5632 7168 5089
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
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