In which of the following scheduling criteria, context switching will never take place?
None of these; all can involve context switching.
Context switching can occur when a running process finishes or blocks, as well as when it is preempted. Even non-preemptive SJF can switch to another process after completion or blocking. Thus no scheduling algorithm listed guarantees that context switching will never occur.
Important Questions from Process Scheduling - Teaching
Consider the following 3 processes with the length of the CPU burst time given in milliseconds :
Process Arrival Time Burst Time P1 0 8 P2 1 4 P3 2 9 What is the average waiting time for these processes if they are scheduled using preemptive shortest job first scheduling algorithm?
Consider the following four processes with the arrival time and length of CPU burst given in milliseconds :
Process Arrival Time Burst Time P 1 0 8 P 2 1 4 P 3 2 9 P 4 3 5 The average waiting time for preemptive SJF scheduling algorithm is
Which of the following is not a CPU scheduling Algorithm?
Which of the following statement(s) is/are true about CPU scheduling algorithm?
I. Shortest remaining time first scheduling may cause starvation
II. Round Robin is better than First Come First Serve in terms of response time
A process residing in main memory and ready and waiting for execution, is kept on
