Question

Consider the following string of page references: 7, 0, 1, 2, 0, 3, 0, 4, 2,...

Consider the following string of page references: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2. The main memory can only contain THREE frames. Show the frame allocation for: (60 points)

  1. FIFO (First-in-First-out)
  2. LRU (Least Recently Used)
  3. Clock
  4. Optimal (assume the page reference string continues with 1, 2, 0, 1, 7, 0, 1)
  5. List the total number of page faults and the miss rate for each policy. Count page faults only after all frames have been initialized.
Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

I calculate total page fault and page hit for all cases in the below image

Part (c) in the below image

if this solution is helpful for you then please like my answer

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 7, 6, 7...
Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 7, 6, 7 Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? Show your working. First in First out Least Recently Used Optimal Replacement Calculate the no. of page faults for each algorithm. Which algorithm performs best for the given reference string?
onsider the following page reference string: 3, 8, 2, 9, 8, 2, 3, 9, 2, 8...
onsider the following page reference string: 3, 8, 2, 9, 8, 2, 3, 9, 2, 8 Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? Show your working. (10-marks) First in First out Least Recently Used Optimal Replacement Calculate the no. of page faults for each algorithm. (3-marks) Which algorithm performs best for the given reference string? (2-marks)
Consider a process with a logical address space of 4 pages of 1024 bytes per page,...
Consider a process with a logical address space of 4 pages of 1024 bytes per page, mapped onto a physical memory of 64 frames. A. How many bits are there in the logical address? B. How many bits are there in the physical address? C. Given the following page table map: page 0 is mapped to frame 3, page 1 is mapped to frame 14, page 2 to frame 6, and page 3 to frame 33, what is the physical...
The following is a page table for a system with 12-bit virtual and physical addresses and...
The following is a page table for a system with 12-bit virtual and physical addresses and 256-byte pages. Free page frames are to be allocated in the order 9, 15, 5. A dash for a page frame indicates that the pagesis not in memory. Page Page Frame 0 4 1 11 2 10 3 - 4 - 5 2 6 - 7 0 8 12 9 1 Convert the following virtual addresses (given in hexadecimal) to their equivalent physical. Assume...
1. What is the average waiting time for Processes If the Operating System uses the Shortest-Job-First...
1. What is the average waiting time for Processes If the Operating System uses the Shortest-Job-First (SJF) Scheduling Algorithm? (P1=5 ms, P2=10 ms, P3=15 ms) 2. How many page faults occur in the Optimum Page Replacement algorithm (OPR) with the following reference string for three-page frames?    Reference String: 4,2,1,3,2,3,4,1 3. What is the average waiting time for Processes If the Operating System uses Shortest-Job-Remaining-First (SJRF) Scheduling Algorithm? (P1=5 ms, P2=10 ms, P3=15 ms) Arrival Time ( P1=0 ms, P2=5...
Java question Consider the following: 1 class SnoopDogg { 2 int count; 3 } 4 class...
Java question Consider the following: 1 class SnoopDogg { 2 int count; 3 } 4 class Test { 5 public static void main ( String [] args ) { 6 SnoopDogg myCount = new SnoopDogg (); 7 myCount.count = 0; 8 int times = 0; 9 increment( myCount, times ); 10 System.out.println( myCount.count ); 11 System.out.println( times ); 12 } 13 public static void increment (SnoopDogg sd, int times ) { 14 sd.count = sd.count + 1; 15 times =...
(1 2 -3)          (1 -3 0) (3 2 -4) x X =(10 2 7) (2 -1...
(1 2 -3)          (1 -3 0) (3 2 -4) x X =(10 2 7) (2 -1 0)          (10 7 8) solve matric equation
Stem Leaf 2 6 3 0, 7 4 0, 2, 6 5 1, 5, 7, 9,...
Stem Leaf 2 6 3 0, 7 4 0, 2, 6 5 1, 5, 7, 9, 9 6 0, 2, 5, 8 1) standard deviation: 2)Find Five-number summary of the data set 3). Draw a box plot that represents the data set
Given the following unordered array: [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]...
Given the following unordered array: [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] W X D T P N R Q K M E If the array was being sorted using the SHELL sort and the halving method, and sorting into ASCENDING order as demonstrated in the course content, list the letters in the resulting array, in order AFTER the FIRST pass. [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]
Consider the sample space of single-digit integers S= 0, 1, 2, 3, 4, 5, 6, 7,...
Consider the sample space of single-digit integers S= 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 And let A= 2, 4, 6, 8 B= 1, 3, 5, 7, 9 C= 0, 1, 2, 3 A) Are events A and B mutually exclusive? B) Are events A and C mutually exclusive?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT