Longest Job First CPU Scheduling || CPU Scheduling

Longest Job First (LJF) is a non-preemptive scheduling algorithm. This algorithm is based on the burst time of the processes. The processes are put into the ready queue based on their burst times i.e., in descending order of the burst times. As the name suggests this algorithm is based on the fact that the process with the largest burst time is processed first. The burst time of only those processes is considered that have arrived in the system until that time.

Introduction to CPU Scheduling and FCFS Scheduling
https://youtu.be/JiuTNobZ4S8?si=wRoMo4VD4Vy0eplH

Shortest Job First CPU Scheduling
https://youtu.be/ZsiSIcNuCVo?si=bT5_YM6StthhLss0

Видео Longest Job First CPU Scheduling || CPU Scheduling канала CSE Logix