286 views

1 Answer

0 votes
0 votes
When α<β<ɤ then if follows last in first out scheduling. Here's the explanation :-

All the processes in the ready queue has the same initial priority ɤ. Their priority decreases at the same rate α(α<ɤ).  Thus, the earlier the process enters the ready queue, the lower its priority will be.

Once the process with the highest priority(last-come compared to other process in the ready queue) is running, no other process in the ready queue will preempt it since its priority decreases at a lower rate (α<β<ɤ) than the priorities of those processes in the ready queue. But it will be preempted by any new coming process because the new process's priority is ɤ which is the highest possible priority.

So answer is Option B.
edited by

Related questions

0 votes
0 votes
0 answers
1
Dknights asked Jan 19
140 views
Can someone please explain how to calculate TLB size?
0 votes
0 votes
1 answer
2
Dknights asked Oct 6, 2023
250 views
if there is a deadlock then mutual exclusion or progress or bound wait or circular wait can be there.but if there is no mutual exclusion or any one of the other propertie...
1 votes
1 votes
1 answer
3
yuvrajeyes asked Dec 31, 2022
221 views
Since Dealock No Progressthen Does Progess No Deadlockbcoz contrapositive should be true.
0 votes
0 votes
2 answers
4
shivang1234 asked Jan 19, 2022
599 views
In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?