Ok see editing. In Round Robin if Time quantum is less, More number of processes are present and All processes burst times are high than TQ then throughput decreases because all processes execute for TQ and wait in queue In HRRN It favors shorter jobs but limit waiting time of longer processes In FIFO if longer jobs arrived first then its Throughput decreases In SJF smaller processes will execute first, it cause starvation of longer processes but compared to other scheduling algorithms SJF results maximum throughput.
So Answer is SJF. Suneel Padala answered Dec 14, Next Qn. Answer: B. Related questions 8 votes. ISRO On a system using non-preemptive scheduling, processes with expected run times of 5, 18, 9 and 12 are in the ready queue.
In what order should they be run to minimize wait time? Which of the following is not a feasible schedule without violating any job schedule? Kathleen asked in Operating System Sep 15, Is mutual exclusion guaranteed now?
Can deadlock occur? Subjects All categories General Aptitude 2. Follow gateoverflow. GATE Overflow. Recent Blog Comments I believe you are too much in respect of IITD has no institutional support regarding This discussion on Consider a set of n tasks with known runtimes r1, r2, Can you explain this answer?
The Questions and Answers of Consider a set of n tasks with known runtimes r1, r2, If the answer is not available please wait for a while and a community member will probably answer this soon.
Upgrade to Infinity. By continuing, I agree that I am at least 13 years old and have read and agree to the terms of service and privacy policy.
The Best you need at One Place. Start Your Infinity Experience. Forgot Password. Enter OTP. Btw thanku for the questions.. Answer for question no 15 is correct. Because at time 2 when P1 is pre-emptied it goes to ready queue directly. At this time P3 has not arrived. So P1 gets its second chance before P3 gets its first chance. Note when P3 arrived P1 was already in queue waiting for its next chance.
So the order of execution goes like P1, P2, P1, P3, This is well explained by the author using ready queue. The aim is to find average waiting time and average turnaround time? Org Powered by Bootstrap Blogger Templates. Which scheduling policy is most suitable for a time-shared operating systems? It is designed especially for time-sharing systems. GATE 2. Consider a set of n tasks with known runtimes r1, r2, … rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?
Shortest Job First has maximum throughput because in this scheduling technique shortest jobs are executed first hence maximum number of tasks are completed. Note: Highest-Response-Ratio-Next policy favors shorter jobs, but it also limits the waiting time of longer jobs. Which of the following scheduling algorithms is non-preemptive? GATE 4. Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively.
How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2. Group I Group II. P Gang Scheduling 1 Guaranteed Scheduling.
Ans: option a Explanation:. Gang scheduling is a scheduling algorithm for parallel systems that schedules related threads or processes to run simultaneously on different processors.
Rate monotonic scheduling is a scheduling algorithm used in real-time operating systems with a static-priority scheduling class. Fair Share Scheduling is a scheduling strategy in which the CPU usage is equally distributed among system users or groups, as opposed to equal distribution among processes.
It is also known as Guaranteed scheduling. Assume that the following jobs are to be executed on a single processor system. Four jobs to be executed on a single processor system arrive at time 0 in the order A, B, C, D. The completion time of A under round robin scheduling with time slice of one time unit is a 10 b 4 c 8 d 9 Ans: option d. GATE 9. Both the processes were created at nearly the same time. Which of the following scheduling strategies will result in the least CPU utilization over a long period of time for this system?
Consider the following set of processes, with the arrival times and the CPU burst times given in milliseconds. GATE
0コメント