3. Consider FIFO, in slide 32 like below: Reference string: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1 ■ 3 frames (3 pages can be in memory at a time per process) reference string 7012 0 3 04 2 3 0 77 2 4 4 4 0 3 2 201 page frames 15 page faults 2 OWN 3 0 3 2 1 201701 0 0 1 1 3 2 712 NOV 2 7 0 1 4. Consider Optimal algorithm. where it shows 9 < 15 faults when there are 3 frames. (a) Repeat with 5 (five) frames. How many page faults are there? (b) How many page faults will be there if we use 9 (nine) frames? For this part (b), you can use mathematical argument without really showing how the frames look for each new number. (c) How many page faults will be there is we use 1 (one) frame? Explain!

3. Consider FIFO, in slide 32 like below: Reference string: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1 ■ 3 frames (3 pages can be in memory at a time per process) reference string 7012 0 3 04 2 3 0 77 2 4 4 4 0 3 2 201 page frames 15 page faults 2 OWN 3 0 3 2 1 201701 0 0 1 1 3 2 712 NOV 2 7 0 1 4. Consider Optimal algorithm. where it shows 9 < 15 faults when there are 3 frames. (a) Repeat with 5 (five) frames. How many page faults are there? (b) How many page faults will be there if we use 9 (nine) frames? For this part (b), you can use mathematical argument without really showing how the frames look for each new number. (c) How many page faults will be there is we use 1 (one) frame? Explain!

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: 6. Given that main memory is composed of four-page frames for public use and that a program requests…

A: Here, we are going to tell the value of all 4 page frames using FIFO, LRU and LFU.

Q: To implement LRU, each page uses a referenced bit. If we wanted to implement a least frequently used…

A: Nothing has to be entered into the database for Least Recently Used. because the page will be…

Q: int main() { Int x = 3; cout << fun1(3); return 0; } int fun(int y) { if (y ==0) } return 1; else…

A: Based on the provided code, let's analyze the runtime stack including all activation record…

Q: We study the simulator vsfy.py and generate the following instance. Please select the correct…

A: The given instance represents the state of a file system simulator before and after a sequence of…

Q: [JAVA] attached below is the problem statement…

A: Step 1 : STARTStep 2 : implement the method called solutionStep 3 : add arraylist to arrStep 4 :…

Q: .data var1 SBYTE -4,-2,3,1 var2 WORD 1000h,2000h,3000h,4000h var3 SWORD -16,-42 var4 DWORD…

A: Given data, .data var1 SBYTE -4,-2,3,1 var2 WORD 1000h,2000h,3000h,4000h var3 SWORD -16,-42 var4…

Q: 0 1 2 2 56 76 T 0 1 2 2 56 76 P 12 12 12 12 12 12 P 10 20 30 40 50 60 T -100 24 35 -16 -50 -50 T…

A: In this question we have to write a program for execution with the given input file data to result…

Q: Consider the following page reference string for a 12-page executable.…

A: Total frames: 4 Algorithm: FIFO Reference string length: 24 references String: 011 3 4 10 5 22 10 6…

Q: A system uses proportional allocation (according to process size) when allocating frames to…

A: Proportional allocation: Frames are allocated to each process according to the process size. For a…

Q: Assignment LRU paging program has the following page reference string 0123342453346256 If we…

A: LRU (Least Recently Used) paging is the page replacement algorithm, in which a new page is referred…

Q: 8.5. A process references five pages, A, B, C, D, and E, in the following order: A; B; C; D; A; B;…

A: First In First Out works by moving that page out of memory which entered first. Wherever the object…

Q: Suppose a process page table contains the entries shown below. Using the format shown inFigure…

A: The logical address space is the location of a particular task . As referenced in the question the…

Q: Can someone please explain this snippet of code in plain English

A: This is very simple. It is a simple demonstration of data parallelism in which the same operation is…

Question

3. Consider FIFO, in slide 32 like below:
Reference string: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1
3 frames (3 pages can be in memory at a time per process)
reference string
7
7
0 1 2 0 3 0 4 2 3 0 3 2
1
7 7 2
0
0
0
1
page frames
15 page faults
2
3
1
230
430
4 4 0
2 2
2
0 3 3
2017 01
0
0
1
1
3 2
7
1
2
702
7
0
1
4. Consider Optimal algorithm. where it shows 9 < 15 faults when there are 3 frames.
(a) Repeat with 5 (five) frames. How many page faults are there?
(b) How many page faults will be there if we use 9 (nine) frames? For this part (b), you can use mathematical
argument without really showing how the frames look for each new number.
(c) How many page faults will be there is we use 1 (one) frame? Explain!

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Optimal page replacement algorithm

VIEW

Step 2: Calculation with 5 frames

VIEW

Step 3: Calculation with 9 frames

VIEW

Step 4: Calculation with 1 frame

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 5 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

A machine has a memory of 64 frames, with each frame being 1K bytes. Current free-frame list is: O×2E, Ox27, Ox37, Ox25, OX0C, Ox04, OXOE, Ox09, O×1D, Ox14, Ox16, Ox07, 0x22, 0×3E, and Ox30. You just scheduled a process that requires 10 frames. Show the resulting page table. Show the translation of logical address Ox240B and OX5A32 into physical addresses using your page table. Express your result in hex.
Calculate the total page faults using the CLOCK algorithm and a window size = 3 frames Given the following reference string : 1 2 1 3 45 3245 6 4 3 2 Fill in chart. Include the use bit (required for last set of frames only) There is no internal fragmentation. Total page faults CLOCK algorithm The process running has at least The size of a frame is 256 bytes. The program has at least pages in the program. bytes 3 4 5265
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. How many bits are used for the page number? How many bits are used for the offset? 8 bits each. With this system, what’s the maximum number of pages that a process can have? 256 Suppose that each entry in the page table comprises 4 bytes (including the frame number, the valid bit, and miscellaneous “bookkeeping bits”). An OS uses an array to store the page table. What is the size of the page table? 1024 Bytes Furthermore, suppose the first 6 pages of a process map to frames 222 to 227 (as decimal numbers), and the last 5 pages of the process map to frames 1 to 5 (also decimal numbers). All other pages are invalid. Draw the page table, including the valid bit and the frame number. DONE Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert…
in python using kernel
Suppose we're modelling an RC crane which is receiving a sequence of input commands, each of which is UP, DOWN, or BEEP. This crane has only two vertical positions, and starts in the high position. It should go into an ERROR end state if it is asked to go UP when it is in the high position or DOWN when it is in the low position. Once it is in the ERROR state, it stays in the ERROR state no matter what commands it receives. BEEP commands are legal at any point. Give a state diagram for this system, in which each edge corresponds to receiving a single command.
The WIMP layout is used in computer displays. Most WIMP implementations adhere to the Desktop metaphor, which links common actions to their physical counterparts. A file may be relocated by selecting it and dragging it to a new location, such as a folder or a filing cabinet. Provide two actions and their corresponding real-world instances.
Short Answer: A program has the following page reference string 0122 3 4 4 1 3 3 25 66 2 4 If we allocate three page frames to the program using LRU a. Please draw a figure to show the page allocation/replacement. b. How many page faults will be generated?