6 6 votes A starvation free job scheduling policy guarantees that no job indefinitely waits for a service. Which of the following job scheduling policies is starvation free? Priority queing Shortest job first Youngest job first Round robin Operating System isro2013 operating-system process-scheduling + – Misbah Ghaya 5.5k views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Hira Thakur commented Oct 15, 2016 reply Follow flag what is yongest jobs first sheduling algorthms here?? 0 0 replyShare sudsho commented Oct 15, 2016 reply Follow flag any preemptive scheduling algo is not starvation free...so round robin will be true here..youngest job firsr...dont know what but sounds preemptive 0 0 replyShare Please log in or register to add a comment.
7 7 votes Round Robin is starvation free .Each and every process is given equal CPU time . While the other Scheduling policy favour a a particular type of process ( say shortest job first ) which will cause Starvation ! Dexter answered May 2, 2016 Dexter comment Share Follow See all 2 Comments 2 2 Comments reply Pankaj Bhilingwal commented Apr 25, 2017 reply Follow flag why priority queuing is not the answer ...??? 0 0 replyShare G Phalkey commented Jan 15, 2019 reply Follow flag might be the case when lower priority process gets scheduled or prempted when long series of high priority process arriving in the main memory..but round robin can cause blocking but it ensure that each process will execute for time slice 1 1 replyShare Please log in or register to add a comment.
1 1 vote Round Robin – this gives all processes equal access to the processor. The other techniques each select some “types” of processes to others (e.g. short processes, high priority processes etc). kvkumar answered Jun 28, 2016 kvkumar comment Share Follow 0 reply Please log in or register to add a comment.
