For a fixed number of processes, SJF scheduling algorithm: O a. Minimize average waiting time. O...

 

Transcribed Image Text:

For a fixed number of processes, SJF scheduling algorithm: O a. Minimize average waiting time. O b. Only Minimize average waiting time and Minimize average turn-around time O. Only Maximizes CPU throughput and Minimize average response time. O d. Minimize average turn-around time. O e. Maximizes CPU throughput Question 21 Context switching can become a burden with increasing the frequency of the short term scheduler. Which one of the following can increase the speed of context switching in a computer system? Not yet answered Marked out of 1.00 P Flag question O a. Increase the bus width of the CPU Ob. Increase the number of concurrent processes Oc. Implement hardware support to copy registers in one instruction d. Reduce the number of concurrent processes For a fixed number of processes, SJF scheduling algorithm: O a. Minimize average waiting time. O b. Only Minimize average waiting time and Minimize average turn-around time O. Only Maximizes CPU throughput and Minimize average response time. O d. Minimize average turn-around time. O e. Maximizes CPU throughput Question 21 Context switching can become a burden with increasing the frequency of the short term scheduler. Which one of the following can increase the speed of context switching in a computer system? Not yet answered Marked out of 1.00 P Flag question O a. Increase the bus width of the CPU Ob. Increase the number of concurrent processes Oc. Implement hardware support to copy registers in one instruction d. Reduce the number of concurrent processes

Answer rating: 100% (QA)

BMinimize average waiting time and minimize average turnaround time Shortest Job FirstSJF scheduling ... View the full answer