1,072 views
3 3 votes

Consider the following set of processes, and schedule them using the Multi-levelf eedback queue CPU scheduling algorithm as used in UNIX SVR3.

P's    CB     AT      Base Priority

P1     2        0              60

P2     1.       1              60

P3     3.       2              60

Also prepare a gantt chart for the following..

 

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
2.5k
2.5k views
rahul sharma 5 asked Aug 21, 2017
2,516 views
Does multilevel feedback queue suffer starvation?
14 14 votes
4 answers 4 answers
16.5k
16.5k views
junaid ahmad asked Jul 6, 2017
16,542 views
Consider a system which has a CPU bound process,which require the burst time of 40 seconds.The multilevel Feed Back Queue scheduling algorithm is used and the queue time ...
5 5 votes
3 3 answers
2.6k
2.6k views
Aayush Mittal asked Jun 12, 2015
2,647 views
Thread is a light-weight sub-process. If so, what is executed by the processor? Process or thread? If it is thread, why do we say that ready queue has processes? Should n...
1 1 vote
2 2 answers
1.8k
1.8k views
nandini gupta asked Aug 26, 2018
1,810 views
Is the statement true or false?With a MLFQ scheduler, high priority jobs have longer time slices than low priority jobs.