Page address stream 2 3 2 15 2 4 5 3 2 5 2 3 4 4. 3. 5n 4 3 OPT 3 5n 3 3. 5. F F F 2 2 3. LRU 3 1 1 4 F F F F 2 5. 3 3. FIFO 3 4 4. 4 F F F F F F 2* 3* 2* 3* 5 5 2* 5 5" 2* 3* 3" 2* 4 3 CLOCK → 3* 3 2* 4 5H F F F F 2. 324 54 524 2/3 23 2/3 23
Consider the following string of page references 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2.
Complete a figure similar to Figure 8.14, showing the frame allocation for:
Clock
Since you have posted a question with multiple sub-parts, according to the company's policy we will solve the first three sub-parts for you. To get the remaining sub-part solved please repost the complete question and mention the sub-parts to be solved.
FIFO (First-In-First-Out): In this algorithm, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal.
Considering 3 frames (3 pages can be in memory at a time per process)
String of page references : 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2
| Page Address Stream | 7 | 0 | 1 | 2 | 0 | 3 | 0 | 4 | 2 | 3 | 0 | 3 | 2 |
| FIFO | 7 | 7 | 7 | 2 | 2 | 2 | 2 | 4 | 4 | 4 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 3 | 3 | 3 | 2 | 2 | 2 | 2 | 2 | ||
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 3 | 3 | 3 | 3 | |||
| Page Faults | F | F | F | F | F | F | F |
Total number of page faults = 7
LRU (Least Recently Used): In this algorithm page will be replaced which is the least recently used.
| Page Address Stream | 7 | 0 | 1 | 2 | 0 | 3 | 0 | 4 | 2 | 3 | 0 | 3 | 2 |
| LRU | 7 | 7 | 7 | 2 | 2 | 2 | 2 | 4 | 4 | 4 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 3 | 3 | 3 | 3 | ||
| 1 | 1 | 1 | 3 | 3 | 3 | 2 | 2 | 2 | 2 | 2 | |||
| Page Faults | F | F | F | F | F | F |
Total number of page faults = 6
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
