We have a system that uses virtual memory and a swap partition. The virtual address space consists of 8 pages, while the physical address space consists of 8 frames. The page size is 4 KiB = 4096 B. Currently, two processes are running: II₁ in П2. Below you can find page tables of both processes, the state of the main memory and the state of the swap partition. For each frame (physical memory), we know the loading time. Loaded 7 7 ☑ 7 p. 2 of II₂ 85 6 X 6 X 6 p. 1 of II₂ 60 5 1 52 5 p. 3 of II₁ 95 4321 X 4 4 p. 2 of II₁ 110 35 3 X 3 p. 0 of II₂ 40 2 4 27 2 p. 5 of II₂ 125 x 16 1 p. 5 of II₁ 120 00 03 0 p. 0 of II₁ 25 (a) Page table of II₁ (b) Page table of II2 (c) RAM p. 6 p. 3 p. 1 p. 6 of II of II of II of II₂ (d) Swap Figure 1: Current state of the system We are given a sequence of LOAD instructions of processes II₁ and II2. For each instruction, we also know the time when it is executed. Convert virtual addresses (argument of the LOAD instruction) to physical ones. If necessary, perform a page replacement beforehand. The FIFO algorithm is used for page replacement. Clearly mark all changes in all tables. Time 130: I₁: LOAD 320 Time 135: II₁: LOAD 10 000 ⚫ Time 150: II₁: LOAD 22 242 ⚫ Time 160: II2: LOAD 9982 Time 185: II2: LOAD 15 000 Time 205: II₁: LOAD 550 Time 225: II2: LOAD 24 888 • Time 230: II2: LOAD 8200
We have a system that uses virtual memory and a swap partition. The virtual address space consists of 8 pages, while the physical address space consists of 8 frames. The page size is 4 KiB = 4096 B. Currently, two processes are running: II₁ in П2. Below you can find page tables of both processes, the state of the main memory and the state of the swap partition. For each frame (physical memory), we know the loading time. Loaded 7 7 ☑ 7 p. 2 of II₂ 85 6 X 6 X 6 p. 1 of II₂ 60 5 1 52 5 p. 3 of II₁ 95 4321 X 4 4 p. 2 of II₁ 110 35 3 X 3 p. 0 of II₂ 40 2 4 27 2 p. 5 of II₂ 125 x 16 1 p. 5 of II₁ 120 00 03 0 p. 0 of II₁ 25 (a) Page table of II₁ (b) Page table of II2 (c) RAM p. 6 p. 3 p. 1 p. 6 of II of II of II of II₂ (d) Swap Figure 1: Current state of the system We are given a sequence of LOAD instructions of processes II₁ and II2. For each instruction, we also know the time when it is executed. Convert virtual addresses (argument of the LOAD instruction) to physical ones. If necessary, perform a page replacement beforehand. The FIFO algorithm is used for page replacement. Clearly mark all changes in all tables. Time 130: I₁: LOAD 320 Time 135: II₁: LOAD 10 000 ⚫ Time 150: II₁: LOAD 22 242 ⚫ Time 160: II2: LOAD 9982 Time 185: II2: LOAD 15 000 Time 205: II₁: LOAD 550 Time 225: II2: LOAD 24 888 • Time 230: II2: LOAD 8200
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
Transcribed Image Text:We have a system that uses virtual memory and a swap partition. The virtual address
space consists of 8 pages, while the physical address space consists of 8 frames. The page
size is 4 KiB = 4096 B. Currently, two processes are running: II₁ in П2. Below you can
find page tables of both processes, the state of the main memory and the state of the
swap partition. For each frame (physical memory), we know the loading time.
Loaded
7
7 ☑
7
p. 2 of II₂
85
6
X
6 X
6
p. 1 of II₂
60
5
1
52
5
p. 3 of II₁
95
4321
X
4
4
p. 2 of II₁
110
35
3
X
3
p. 0 of II₂
40
2
4
27
2
p. 5 of II₂
125
x
16
1
p. 5 of II₁
120
00
03
0
p. 0 of II₁
25
(a) Page table of II₁
(b) Page table of II2
(c) RAM
p. 6
p. 3
p. 1
p. 6
of II of II
of II
of II₂
(d) Swap
Figure 1: Current state of the system
We are given a sequence of LOAD instructions of processes II₁ and II2. For each instruction,
we also know the time when it is executed. Convert virtual addresses (argument of the
LOAD instruction) to physical ones. If necessary, perform a page replacement beforehand.
The FIFO algorithm is used for page replacement. Clearly mark all changes in all tables.
Time 130: I₁: LOAD 320
Time 135: II₁: LOAD 10 000
⚫ Time 150: II₁: LOAD 22 242
⚫ Time 160: II2: LOAD 9982
Time 185: II2: LOAD 15 000
Time 205: II₁: LOAD 550
Time 225: II2: LOAD 24 888
• Time 230: II2: LOAD 8200
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
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