Scribd
Upload
25 views

Shortest Job First Muhammad Radhi Bin Razif 14DTK10F1044 Mohd Helmi Farhan Bin Kumasih 14DTK10F1007 Shazul Afizi Bin Zulkiflee 14DTK10F1004

Shortest Job First (SJF) is a scheduling algorithm that selects the process with the shortest expected CPU burst time to execute next. It is a nonpreemptive algorithm, meaning once a process begins execution it cannot be interrupted. SJF aims to minimize average waiting times and will prioritize I/O bound processes. While optimal in theory, it requires knowledge of future process burst times.

Uploaded by

OPie UPie
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
25 views

Shortest Job First Muhammad Radhi Bin Razif 14DTK10F1044 Mohd Helmi Farhan Bin Kumasih 14DTK10F1007 Shazul Afizi Bin Zulkiflee 14DTK10F1004

Shortest Job First (SJF) is a scheduling algorithm that selects the process with the shortest expected CPU burst time to execute next. It is a nonpreemptive algorithm, meaning once a process begins execution it cannot be interrupted. SJF aims to minimize average waiting times and will prioritize I/O bound processes. While optimal in theory, it requires knowledge of future process burst times.

Uploaded by

OPie UPie
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Shortest Job First Muhammad Radhi Bin Razif Mohd Helmi Farhan Bin Kumasih Shazul Afizi Bin

Zulkiflee

14DTK10F1044 14DTK10F1007 14DTK10F1004

Shortest Job First (SJF)


Selection function: the process with the shortest

expected CPU burst time. Decision mode: Nonpreemptive. Called also Shortest Time First (STF) and Shortest Process Next (SPN). I/O bound processes will be picked first. SJF is optimal gives minimum average waiting time for a given set of processes.

Short job first scheduling


Two schemes: Non-preemptive once CPU given to the process it cannot be preempted until completes its CPU burst
Preemptive if a new process arrives with CPU burst length less than remaining time of current executing process, preempt. This scheme is know as the Shortest-RemainingTime-First (SRTF)

Short job first scheduling- Nonpreemptive

You might also like