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 II₂. 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. 7 65 4 765 X 7 p. 2 of II₁ Loaded 125 6 x 6 p. 3 of II2 65 3 5 p. 6 of II₁ 95 4 4 4 p. 5 of II₁ 20 3 × 3 6 3 p. 5 of II₂ 55 2 7 2 2 p. 0 of II₂ 135 1 × 1 0 1 p. 0 of II₁ 110 0 1 0 2 0 p. 1 of II₂ 35 (a) Page table of II₁ (b) Page table of II₂ (c) RAM p. 1 p. 2 p. 4 p. 7 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 145: II2: LOAD 13000 Time 155: II2: LOAD 20800 Time 160: II₁: LOAD 10000 Time 165: II₁: LOAD 5011 Time 200: II2: LOAD 10030 Time 225: II2: LOAD 4120 Time 240: II₁: LOAD 20805 • Time 255: II₁: LOAD 675

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
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 II₂. 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.
7
65
4
765
X
7
p. 2 of II₁
Loaded
125
6 x
6
p. 3 of II2
65
3
5
p. 6 of II₁
95
4
4
4
p. 5 of II₁
20
3
×
3
6
3
p. 5 of II₂
55
2
7
2
2
p. 0 of II₂
135
1
×
1
0
1
p. 0 of II₁
110
0
1
0
2
0
p. 1 of II₂
35
(a) Page table of II₁
(b) Page table of II₂
(c) RAM
p. 1 p. 2
p. 4
p. 7
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 145: II2: LOAD 13000
Time 155: II2: LOAD 20800
Time 160: II₁: LOAD 10000
Time 165: II₁: LOAD 5011
Time 200: II2: LOAD 10030
Time 225: II2: LOAD 4120
Time 240: II₁: LOAD 20805
• Time 255: II₁: LOAD 675
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 II₂. 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. 7 65 4 765 X 7 p. 2 of II₁ Loaded 125 6 x 6 p. 3 of II2 65 3 5 p. 6 of II₁ 95 4 4 4 p. 5 of II₁ 20 3 × 3 6 3 p. 5 of II₂ 55 2 7 2 2 p. 0 of II₂ 135 1 × 1 0 1 p. 0 of II₁ 110 0 1 0 2 0 p. 1 of II₂ 35 (a) Page table of II₁ (b) Page table of II₂ (c) RAM p. 1 p. 2 p. 4 p. 7 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 145: II2: LOAD 13000 Time 155: II2: LOAD 20800 Time 160: II₁: LOAD 10000 Time 165: II₁: LOAD 5011 Time 200: II2: LOAD 10030 Time 225: II2: LOAD 4120 Time 240: II₁: LOAD 20805 • Time 255: II₁: LOAD 675
Expert Solution
steps

Step by step

Solved in 2 steps with 6 images

Blurred answer
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