... the process that requests the CPU first is allocated the CPU first; it generates an average waiting time that varies significantly according to the CPU burst times. But it produces a "convoy effect", where all the other processes wait for the one big process to get off the CPU. It is non-preemptive in the sense that a process will not be pre-empted until it has finished running. Shortest-Job-First (SJF): In SJF the CPU is assigned to the process with the smallest next CPU burst, it generates the minimum average waiting time for a given set of processes. But there is no way to know the length of the next CPU burst, therefore Prediction is used to decide the length of the next CPU burst. SJF may be preemptive or nonpreemptive Priority Scheduling: In priority scheduling a priority is associated with each process, and the CPU is allocated to the process with the highest ...

See this essay or coursework document in full right now