1,306 views
0 0 votes

2 Answers

0 0 votes
I guess correct answer is option B.

As required scheduling is LIFO so the process that arrivals late should have higher priority thus $\gamma$ should be greater than the rate at which the priority is increasing at ready queue such that the last entered process has highest priority to enter the running state. And To allow the last process to preempt the running process $\gamma$ should also be greater than $\beta$
Position:
Show:

Related questions

4 4 votes
1 1 answer
274
274 views
GO Classes asked Jul 18
274 views
Which of the following statements are correct?The CPU dispatcher determines the policy for which process should be run and when. With cooperative multitasking, it is poss...
3 3 votes
4 4 answers
1.5k
1.5k views
delxbydelt asked Mar 15, 2024
1,532 views
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process require...
2 2 votes
0 0 answers
592
592 views
Raviwarlord asked Nov 18, 2022
592 views
Why do we say that Longest Remaining time first is a starvation free algorithm?Let me walk through my though process, same as LRTF is Shortest Remaining time first and it...
0 0 votes
1 1 answer
2.7k
2.7k views
anupamsworld asked Jun 6, 2022
2,655 views
Lets consider one situation where,OS is scheduling processes(P1,P2,P3...Pn) with Round Robin method and current running process is P1 and next scheduled process in queue ...