Suppose the page table for process B that is currently executed on the processor is as in Table 1. The memory has four (4) frames with a page size of 1 Kbytes in memory. Table 1: Process B page table Page Number Present Bit Frame Number 0 1 2 1 0 2 1 0 3 1 1 4 0 5 0 6 1 3 7 0 Calculate the length (bit) of the logical and physical addresses. List the logical address ranges for each page. Given the following new ordered page references to the logical addresses: 1100 and 2100 Demonstrate how Least Recently Used (LRU) page replacement policy can be used to replace page fault for the above page references considering the previous occurrences of pages: 3, 2, 2, 0, 3, 6, 3.
Suppose the page table for process B that is currently executed on the processor is as in Table 1. The memory has four (4) frames with a page size of 1 Kbytes in memory. Table 1: Process B page table Page Number Present Bit Frame Number 0 1 2 1 0 2 1 0 3 1 1 4 0 5 0 6 1 3 7 0 Calculate the length (bit) of the logical and physical addresses. List the logical address ranges for each page. Given the following new ordered page references to the logical addresses: 1100 and 2100 Demonstrate how Least Recently Used (LRU) page replacement policy can be used to replace page fault for the above page references considering the previous occurrences of pages: 3, 2, 2, 0, 3, 6, 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
Related questions
Topic Video
Question
Suppose the page table for process B that is currently executed on the processor is as in Table
- 1. The memory has four (4) frames with a page size of 1 Kbytes in memory.
Table 1: Process B page table
|
Page Number |
Present Bit |
Frame Number |
|
0 |
1 |
2 |
|
1 |
0 |
|
|
2 |
1 |
0 |
|
3 |
1 |
1 |
|
4 |
0 |
|
|
5 |
0 |
|
|
6 |
1 |
3 |
|
7 |
0 |
|
- Calculate the length (bit) of the logical and physical addresses.
- List the logical address ranges for each page.
- Given the following new ordered page references to the logical addresses:
1100 and 2100
Demonstrate how Least Recently Used (LRU) page replacement policy can be used to replace page fault for the above page references considering the previous occurrences of pages: 3, 2, 2, 0, 3, 6, 3.
- Demonstrate the steps of the main memory address translation (logical addresses to physical addresses). If there is a page fault, compute the physical addresses (in decimal unit) after the page replacement.
- From your understanding, why LRU is better compare to the first-in-first-out (FIFO) policy.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 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