Shortest Job First CPU Scheduling Algorithm
Shortest Job First (SJF) is a simple scheduling algorithm where processes are handled such that the process requiring minimum amount of time is executed first, without priority.
Shortest Job First (SJF) is a simple scheduling algorithm where processes are handled such that the process requiring minimum amount of time is executed first, without priority.