Question

Subject: Operating System. Question 3) Assuming a system has 86 available frames and there are two...

Subject: Operating System.

Question 3) Assuming a system has 86 available frames and there are two processes P1 with size 20 and P2 with size 100, set up the equations to determine how many frames will be assigned to P1 and P2 using the proportional allocation frame allocation scheme.

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

3)

Proportional allocation allocates frames to a process depending on the requirements of the process.

Let 'm' be the total number of available frames.

Let the size of process ' pi ' be 'si '

Let ' S ' be the total size of all the processes, i.e, sum of the sizes of the individual processes.

Allocation to process pi = ( si / S ) * m

Allocation of frames to Process P1 = (20 / 120) * 86 = 14

Allocation of frames to Process P2 = (100 / 120) * 86 = 71

Add a comment
Know the answer?
Add Answer to:
Subject: Operating System. Question 3) Assuming a system has 86 available frames and there are two...
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
  • Question 6 [8 points] A system transmitting synchronous frames operates at a bit rate of 56...

    Question 6 [8 points] A system transmitting synchronous frames operates at a bit rate of 56 kbps. The propagation delay is 19ms. Data is transmitted using a size of frame of 2080 bits. A flow control system using sliding windows is necessary. Determine the minimum size of the window for optimal throughput.

  • a. A system has two processes and three identical resources. Each process needs a maximum of...

    a. A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer. b. A system has 4 processes, P1 through P4, and 5 types of resources, R1 through R5. Existing resource vector E = (3, 2, 1, 2, 2) Current allocation matrix C = R1 R2 R3 R4 R5 P1 1 1 0 0 0 P2 0 0 1 0 0 P2 1 0 0 20 P4 0...

  • Subject : Operating System Banker's Algorithm:             processes = {0, 1, 2, 3, 4};             Available...

    Subject : Operating System Banker's Algorithm:             processes = {0, 1, 2, 3, 4};             Available instances of resources             avail = {3, 4, 2};             Maximum R that can be allocated to processes             maxm[][R] = {{7, 5, 3},                                                 {3, 2, 2},                                                 {9, 0, 2},                                                 {2, 2, 1},                                                 {4, 3, 3}};             Resources allocated to processes             allot[][R] = {{0, 1, 0},                                                 {2, 0, 0},                                                 {3, 0, 2},                                                 {2, 1, 2},                                                ...

  • Using MATLAB PLease For scaffolding system shown, assume P1-50 lbf and P2-20 lbf. Perform force and momentum equilibrium balances for each bar to find 4 equations. Then show how to set them up as one...

    Using MATLAB PLease For scaffolding system shown, assume P1-50 lbf and P2-20 lbf. Perform force and momentum equilibrium balances for each bar to find 4 equations. Then show how to set them up as one system of linear equations ( Ax-b)and solve in MATLAB to determine tension forces T.Ty.TC and To. Hint: write ΣFy-Oand ΣΜ-Ofor each bar to find the equations. Bar 1 For scaffolding system shown, assume P1-50 lbf and P2-20 lbf. Perform force and momentum equilibrium balances for...

  • Answer the following question: Allocation Available A B C D 3 3 2 1 Ро P1...

    Answer the following question: Allocation Available A B C D 3 3 2 1 Ро P1 A B C D 2001 3121 2103 1312 1 432 Max ABCD 4212 5252 2316 1424 36 65 P2 P3 P4 The snapshot of a system 1) Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete. (Format: use process number only, e.g. 01234) 2) If a request from process P1 arrives for (1,1,0,0), can...

  • Please answer the following question in C++ language Consider the following set of processes, with the...

    Please answer the following question in C++ language Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process            Burst Time      Priority P1. 7 5 P2 2 4 P3 11 3 P4 9 1 P5 5 3 The processes are assumed to have arrived in the order P1,P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive...

  • We know that there are different disk allocation methods that help the operating system decide how...

    We know that there are different disk allocation methods that help the operating system decide how disk blocks are allocated for files. In the contiguous disk allocation method, each file occupies a set of consecutive addresses on the disk. While this makes file allocation easier, an increase in the file size means that it has to be assigned elsewhere on the disk. The linked disk allocation method requires including a pointer in the current file, which points to the location...

  • MATLAB R2019a 3. During design and build of any engineering system, it is vital to subject...

    MATLAB R2019a 3. During design and build of any engineering system, it is vital to subject it to extensive testing. Accordingly, one such mechanical system has been subjected to similar tests. In the process, you are required to create a set of 10 random samples for each of the four pressure systems. Create a random matrix of size 10x4 using MATLAB functions such as: for loops and rand. 4. A 3000 pound vehicle is traveling on a road at 100...

  • Question From Operating System: Assume that disk requests are in the disk queue as indicated below....

    Question From Operating System: Assume that disk requests are in the disk queue as indicated below. Assume further that the R/W head begins each simulation with a starting position of track 50 (for C-SCAN you may assume it is moving right). Draw a picture indicating the head-travel using FCFS, SSTF and C-SCAN algorithms presented lgorithms . WAITING REQUESTS (front) 11, 95, 20, 86, 5, 75, 85, 2, 100, 56, 47, 97 (rear)

  • Number Name 3. Assuming no page fault on a page table access, what is the processor...

    Number Name 3. Assuming no page fault on a page table access, what is the processor memory access time for the system depicted in the above figure, for a physical memory with 50ns read/write times? 4. Now, assume that the memory system has a translation look-aside buffer (TLB). The TLB requires 10 ns to determine a hit or mess. The physical memory system has an access time of 50ns. You may assume that page fault rate for the application is...

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
ADVERTISEMENT