Understanding the Shortest Job First Algorithm (Non-preemptive)
问题 The shortest job first algorithm is shown in the following image: If it is shortest job first/shortest process next, shouldn't the order be: P1 → P5 → P3 → P4 → P2 ? Since that's the order of lowest to highest service times. Why does process 2 come second? I know if we use burst times instead, that would be the order, but I have no idea what the differences between service time and burst times are. Any help would be much appreciated explaining that graphic. 回答1: The image in the question