Use optimal page replacement technqies and 3-frame allocation with the following data: <1,2,3,4,8,5,9,2,8,9,7,4,10,11,9,12,6,7,4,1,15> Clearly indicate your...

Question

Question

Use optimal page replacement technqies and 3-frame allocation with the following data:

<1,2,3,4,8,5,9,2,8,9,7,4,10,11,9,12,6,7,4,1,15>

engineering Computer-Science

Answer 1

Answer #1

Answer 2

Similar Homework Help Questions

Using a FIFO page replacement algorithm on a 4 frame system, how many faults are generated...

Using a FIFO page replacement algorithm on a 4 frame system, how many faults are generated by the sequence of 4 2 3 4 1 5 3 4 2 0 1 A. 5 B. 7 C. 9 D. 11
Write a program that implements the FIFO, Optimal, MFU, and LRU page-replacement algorithms. Given a page-reference...

Write a program that implements the FIFO, Optimal, MFU, and LRU page-replacement algorithms. Given a page-reference string, where page numbers range from 0 to 9, apply the page-reference string to each algorithm, and output the number of page faults incurred by each algorithm. Write your code so that the number of page frames in the page table can vary from 1 to 10. 1.0 Functional Requirements 1.1: Your program shall be run with the following: ./a.out Example: ./a.out datafile.txt 1.2:...
Consider the following page reference string: 1, 0, 3, 2, 6, 4, 5, 0, 1, 7,...

Consider the following page reference string: 1, 0, 3, 2, 6, 4, 5, 0, 1, 7, 7, 6, 4, 3, 5, 2, 1, 3, 2, 7 Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? Show your work. (a) LRU replacement (b) FIFO replacement (c) Optimal replacement

Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4...

Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4 3 2 5 4 3 4 5 1 5 3 1 6 3 1 Apply LRU, Clock and FIFO algorithms What will be the number of page faults for each replacement algorithm note that page faults at the beginning are counted?
Q1. Consider the following reference string and the frame size is 3 (3 pages can be...

Q1. Consider the following reference string and the frame size is 3 (3 pages can be in main memory at a time) 10 2 3 4 1 2 3 0 3 2 1 4 1 1 0 3 4 1 2 Apply the following page replacement algorithms and find the page faults: a. FIFO b. Optimal LRU
Consider the following page reference string: 5, 3,7,5, 3, 6, 1, 0,4,6,2,0,1,2,7,3,1,4,7,2 Assuming demand paging with...

Consider the following page reference string: 5, 3,7,5, 3, 6, 1, 0,4,6,2,0,1,2,7,3,1,4,7,2 Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms!? LRU replacement FIFO replacement Optimal replacement

Your system has 6 frames with 4 byte pages, and you use LRU for page replacement....

Your system has 6 frames with 4 byte pages, and you use LRU for page replacement. Consider the following string of memory accesses (shown in decimal): 43, 41, 42, 13, 23, 22, 13, 42, 51, 61, 23, 21, 73, 42, 13, 21 How many page faults?
Given the following page-reference string, show the allocation of 3 frames of memory using FIFO ,...

Given the following page-reference string, show the allocation of 3 frames of memory using FIFO , LRU and OPT. How many page faults for FIFO, LRU and OPT? 3,1,2,1,3,1,4,1,3,2,4,2,5,6,4,6,2,1,6,5
1. Consider a system where 3 page frames are allocated to a process. Consider the following...

1. Consider a system where 3 page frames are allocated to a process. Consider the following sequence of memory references: 3 2 1 0 3 2 4 3 2 1 0 4. Assuming no pages are initially in memory, how many page faults are there assuming a FIFO page replacement algorithm is used? 2. Repeat problem 1 with number of frames increased to 4. 3. Compare the number of page faults from 1 and 2. Is there Belady’s anomaly? 4....