Question

There are four processes A(36 pages), B(20 pages) C(28 pages) and D(96 pages) that are requesting...

There are four processes A(36 pages), B(20 pages) C(28 pages) and D(96 pages) that are requesting free frames to be allocated to them out of a total of 92 frames. How many frames would the processes be allocated with a) fixed allocation b) proportional allocation?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Allocation of Page Frames

  • Several physical pages allocated to processes A, B, and C. Process B page faults
  • Each process needs minimum number of pages
  • Want to make sure that all processes that are loaded into memory can make forward progress
  • Example: IBM 370 – 6 pages to handle SS MOVE instruction:

 instruction is 6 bytes, might span 2 pages

 2 pages to handle from

 2 pages to handle to

Fixed Allocation

  • Allocate a minimum number of frames per process

Consider minimum requirements, e.g. on previous slide

 One page from the current executed instruction

 Most instructions require two operands

 Include an extra page for paging out and one for paging in

Proportional Allocation

  • Allocate a number of frames per job proportional to job size

Priority Allocation

 May want to give high priority process more memory than low priority process

 Use a proportional allocation scheme using priorities instead of size

Add a comment
Know the answer?
Add Answer to:
There are four processes A(36 pages), B(20 pages) C(28 pages) and D(96 pages) that are requesting...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • A process references five pages, A, B, C, D, and E, in the following order: B;...

    A process references five pages, A, B, C, D, and E, in the following order: B; C; B; A; E; A; D; E; C; B; D; A Assume that the replacement algorithm is Optimal, find out the number of page faults occurring after the frame allocation is initially filled with an empty main memory with three page frames. Optimal B C B A E A D E C B D A

  • Consider a system in which four processes (A,B,C,D) are attemptign to access four types of resource...

    Consider a system in which four processes (A,B,C,D) are attemptign to access four types of resource (1,2,3,4). There are two instances of each type of resource , and the current allocation is <1001> for A , <0101> for B , <1000> for C , and <0010> for D. The Max Need for each process is <2002> for A , <0202> for B , <1100> for C , and <1010> for D. Is this system state safe? If so give an...

  • Consider the following page reference string: A C B D B A E F B F...

    Consider the following page reference string: A C B D B A E F B F A G E F A Assuming demand paging with four frames, how many page faults would occur for the following replacement algorithms? Remember that all frames are initially empty, so your first unique pages will cost one fault each. Show all of your works. LRU replacement FIFO replacement Optimal (MIN) replacement

  • A system has four resource types (A, B, C, D) and four processes {P1, P2, P3,...

    A system has four resource types (A, B, C, D) and four processes {P1, P2, P3, P4 }.The maximum demands for each process is P1(4,3,2,2), P2(1,2,3,4), P3(1,1,5,0) and P4(3,2,1,5). The current allocation is: P1(1,2,2,1), P2(1,0,3,3) and P3(1,1,1,0) and P4(2,1,0,3). available resource is P1(3,1,1,2) (a) Is this state a safe state? Explain your all answer by identifying a successful future sequence of processes that makes the state safe. 

  • CSUCI Company produces and sells four products; A, B, C, D. The following data relate to...

    CSUCI Company produces and sells four products; A, B, C, D. The following data relate to its four products: A B D 180 120 90 150 $70 $50 Daily demand in units Selling price per unit Variable costs per unit Direct material cost per unit Labor time in minutes per unit $26 $30 $10 $80 $36 $16 $100 $49 $14 $12 N 5 4 3 There are a total of 1,022 minutes available per day. Total fixed costs are $3,200...

  • A 32 B 36 C 34 D 38 Question 5 The pharmacy recieves a controlled substance...

    A 32 B 36 C 34 D 38 Question 5 The pharmacy recieves a controlled substance order from their wholesaler. There are a total of 435 pills. Of this total, 17% are C2, 19% are C3, 20% are C4, and 44% are C5. How many C3 pills were in the order? A 74 B 87 C 19 83

  • The burst times and start times of four processes A,B,C,D are as follows: Process Start Time...

    The burst times and start times of four processes A,B,C,D are as follows: Process Start Time Burst Time A 0   15 B   10 10 C   11 3 D   15 8 Show scheduling of the 4 processes using a Gantt chart for STCF. Compute the wait times for each process, and the average wait time, under STCF.

  • 35. How many types of loops are there? b) 2 0)3 d) 1 a) 4 36....

    35. How many types of loops are there? b) 2 0)3 d) 1 a) 4 36. Pick out the correct statement. a) Increment operator ++adds 1 to its operand b) Increment operator ++adds 2 to its operand e) Decrement operator+subtract 1 to its operand d) None of the mentioned 37. include siostream» a) 20 b) 15 c) 30 . d) 25 using namespace std; int mainO typedef int num num a - 10, b-1; num c =a+b+a-b; cout <e c...

  • A B C D E F -- 28 ол -- A B с D E 20...

    A B C D E F -- 28 ол -- A B с D E 20 53 2757 34 51 46 49 38 44 39 28 20 53 51 27 57 34 -- 3 49 38 41 46 44 F 5 39 3 41 The weights of edges in a graph are shown in the table above. Apply the sorted edges algorithm to the graph. Give your answer as a list of vertices, starting and ending at vertex A. Example:...

  • A stock produced total returns of 15%, 12%, 20%, and -36% over the past four years,...

    A stock produced total returns of 15%, 12%, 20%, and -36% over the past four years, respectively. What is the geometric average return? Select one: a. 2.04% b. 0.27% c. 2.44% d. 1.30% e. 1.30%

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT