2 votes 2 votes Which of the following scheduling algorithms may cause starvation ? First-come-first-served Round Robin Priority Shortest process next Shortest remaining time first a, c and e c, d and e b, d and e b, c and d Operating System ugcnetjan2017ii operating-system scheduling + – go_editor asked Mar 24, 2020 • recategorized May 24, 2020 go_editor 4.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes First-come-first-served- No starvation Round Robin- No starvation Priority- starvation if higher priority process called again and again, lower priority starves Shortest process next -starvation possible Shortest remaining time first -starvation possible as its a preemptive version of shortest process next casuing apotential for longer processes to starve. so option 2--- c,d,e Debasmita Bhoumik answered Feb 11, 2017 • selected Feb 11, 2017 by Arjun Debasmita Bhoumik comment Share Follow See all 4 Comments See all 4 4 Comments reply Arjun commented Feb 11, 2017 reply Follow Share how is it true for 5? 0 votes 0 votes Debasmita Bhoumik commented Feb 11, 2017 reply Follow Share As the Shortest remaining time first scheduling is a preemptive version of shortest job scheduling. It may cause starvation as shorter processes may keep coming and a long CPU burst process never gets CPU. from wiki:- Like shortest job first, it has the potential for process starvation; long processes may be held off indefinitely if short processes are continually added. This threat can be minimal when process times follow a heavy-tailed distribution.[1] A similar algorithm which avoids starvation at the cost of higher tracking overhead is Highest response ratio next. 5 votes 5 votes prachigupta commented Sep 18, 2017 reply Follow Share In FIFO how starvation not possible, as if first process takes longer time then last process can cause starvation. 1 votes 1 votes stripathi77 commented Nov 9, 2019 reply Follow Share In First Come First Serve(FCFS) if a process with a very large Burst Time comes before other processes, the other process will have to wait for a long time but it is clear that other process will definitely get their chance to execute, so it will not suffer from starvation. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes answer is (2)c,d and e manav kothari answered Oct 17, 2017 manav kothari comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Out of the given protocols, only round-robin is sure of not getting the starvation. However, we can assume FCFS to be starvation-free (Only by looking at the options). option is B Prasanjeet Ghosh answered Apr 26, 2018 Prasanjeet Ghosh comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Starvation is the name given to the indefinite postponement of a process because it requires some resource before it can run, but the resource, though available for allocation, is never allocated to this process. 1. Priority: A process ready to run for CPU can wait indefinitely because of low priority. 2. Shortest process next : longest process possibility to get starvation. 3. Shortest remaining time first: longest process possibility to get starvation. Solution: Aging FCFS and Round Robin scheduling never happen indefinite blocking. ANS B Mohit Kumar 6 answered May 7, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.