Which of the algorithms in part a results in the minimum ave

Which of the algorithms in part a results in the minimum average waiting time (overall processes)?

Solution

non premptive – once CPU given to the process it cannot be preempted until completes its CPU burst. process, preempt. This scheme is know as the Shortest-Remaining-Time-First (SRTF). SJF is optimal – gives minimum average waiting time for a given set of processes.