As described in COD Section 5.7 (Virtual memory), virtual memory uses a page table to track the mapping of virtual addresses to physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitute stream of virtual byte addresses as seen on a system. Assume 4 KiB pages, a four-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. TLB Page Table Decimal 4669 2227 13916 34587 48870 12608 49225 0x123d 0x08b3 0x365c 0x871b 0xbee6 0x3140 0xc049 hex Valid 1 1 1 0 Index 0 1 2345678 9 a Tag Oxb 0x7 0x3 0x4 Valid 1 0 0 1 1 1 0 1 0 0 1 Physical Page Number 12 4 6 9 Time Since Last Access 4 1 3 7 Physical Page or in Disk 5 Disk Disk 6 9 11 Disk 4 Disk Disk 3

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
As described in COD Section 5.7 (Virtual memory), virtual memory uses a page table to track the mapping of virtual addresses to physical addresses. This exercise demonstrates how this table is updated as addresses are accessed. The following data represent a stream of virtual byte addresses as seen on a system. Assume 4 KiB pages, a four-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number.

### Decimal Addresses:
- 4669
- 2227
- 13916
- 34587
- 48870
- 12608
- 49225

### Hexadecimal Addresses:
- 0x123d
- 0x08b3
- 0x365c
- 0x871b
- 0xbeee
- 0x3140
- 0xc049

### TLB (Translation Lookaside Buffer):

| Valid | Tag | Physical Page Number | Time Since Last Access |
|-------|-----|-----------------------|------------------------|
| 1     | 0xb | 12                    | 4                      |
| 1     | 0x7 | 4                     | 1                      |
| 1     | 0x3 | 6                     | 3                      |
| 0     | 0x4 | 9                     | 7                      |

### Page Table:

| Index | Valid | Physical Page or in Disk |
|-------|-------|--------------------------|
| 0     | 1     | 5                        |
| 1     | 0     | Disk                     |
| 2     | 0     | Disk                     |
| 3     | 1     | 6                        |
| 4     | 1     | 9                        |
| 5     | 1     | 11                       |
| 6     | 0     | Disk                     |
| 7     | 1     | 4                        |
| 8     | 0     | Disk                     |
| 9     | 0     | Disk                     |
| 10    | 1     | 3                        |
| 11    | 1     | 12                       |

### Tasks:

(a) For each access shown above, list:
- Whether the access is a hit or miss in the TLB.
- Whether the access is a
Transcribed Image Text:As described in COD Section 5.7 (Virtual memory), virtual memory uses a page table to track the mapping of virtual addresses to physical addresses. This exercise demonstrates how this table is updated as addresses are accessed. The following data represent a stream of virtual byte addresses as seen on a system. Assume 4 KiB pages, a four-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. ### Decimal Addresses: - 4669 - 2227 - 13916 - 34587 - 48870 - 12608 - 49225 ### Hexadecimal Addresses: - 0x123d - 0x08b3 - 0x365c - 0x871b - 0xbeee - 0x3140 - 0xc049 ### TLB (Translation Lookaside Buffer): | Valid | Tag | Physical Page Number | Time Since Last Access | |-------|-----|-----------------------|------------------------| | 1 | 0xb | 12 | 4 | | 1 | 0x7 | 4 | 1 | | 1 | 0x3 | 6 | 3 | | 0 | 0x4 | 9 | 7 | ### Page Table: | Index | Valid | Physical Page or in Disk | |-------|-------|--------------------------| | 0 | 1 | 5 | | 1 | 0 | Disk | | 2 | 0 | Disk | | 3 | 1 | 6 | | 4 | 1 | 9 | | 5 | 1 | 11 | | 6 | 0 | Disk | | 7 | 1 | 4 | | 8 | 0 | Disk | | 9 | 0 | Disk | | 10 | 1 | 3 | | 11 | 1 | 12 | ### Tasks: (a) For each access shown above, list: - Whether the access is a hit or miss in the TLB. - Whether the access is a
Expert Solution
steps

Step by step

Solved in 5 steps

Blurred answer
Knowledge Booster
Fundamentals of Memory
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