LJF Scheduling Algorithm Non - Preemptive
Longest Job First (LJF) is a 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. Its preemptive version is called Longest Remaining Time First (LRTF) algorithm.
- This page demonstrates the Longest Job First Non - Premptive (LJF) scheduling algorithm using JavaScript.
- Do's and Dont's
- Do not enter special characters or symbols
- Enter required input specified
- Burst times must not be zero
Process Information
| Name | Arrival Time | Burst Time |
|---|
Gantt Chart
| Process | Start Time | End Time |
|---|
Results Table
| Process | Arrival Time | Burst Time | Completion Time | Turnaround Time | Waiting Time |
|---|---|---|---|---|---|
| Average Waiting Time: | |||||
| Average Turnaround Time: | |||||