Operating System Tutorial

Operating System Tutorial Types of Operating System Evolution of Operating System Functions of Operating System Operating System Properties Operating System Services Components of Operating System Needs of the Operating System

Operating Systems

Linux Operating System Unix Operating System Ubuntu Operating System Chrome Operating Systems Fedora Operating System MAC Operating System MS Windows Operating System Solaris Operating System Cooperative Operating System CorelDRAW Operating System CentOS FreeBSD Operating Systems Batch Operating System MS-DOS Operating System Commercial Mobile Operating Systems


Difference Between Multi-programming and Multitasking Difference between C-LOOK and C-SCAN Difference between Rotational Latency and Disk Assess Time Trap vs Interrupt Difference between C-SCAN and SSTF Difference between SCAN and FCFS Difference between Seek Time and Disk Access Time Difference between SSTF and LOOK Difference between Process and Program in the Operating System Difference between Protection and Security in Operating System

How To

How to implement Monitors using Semaphores How to Install a Different Operating System on a PC


What is Kernel and Types of Kernel What is DOS Operating System What is Thread and Types of Thread What is Process Scheduler and Process Queue What is Context Switching What is CPU Scheduling What is Producer-Consumer Problem What is Semaphore in Operating System Monitors in Operating System What is Deadlock What is Paging and Segmentation What is Demand Paging What is Virtual Memory What is a Long term Scheduler What is Page Replacement in Operating System What is BSR Mode What is Convoy Effect What is Job Sequencing in Operating System Why is it critical for the Scheduler to distinguish between I/O-bound and CPU-bound programs Why is there a Need for an Operating System


Process Management Process State Scheduling Algorithm FCFS (First-come-First-Serve) Scheduling SJF (Shortest Job First) Scheduling Round-Robin CPU Scheduling Priority Based Scheduling HRRN (Highest Response Ratio Next) Scheduling Process Synchronization Lock Variable Mechanism TSL Mechanism Turn Variable Mechanism Interested Variable Mechanism Deadlock Avoidance Strategies for Handling Deadlock Deadlock Prevention Deadlock Detection and Recovery Resource Allocation Graph Banker’s Algorithm in Operating System Fixed Partitioning and Dynamic Partitioning Partitioning Algorithms Disk Scheduling Algorithms FCFS and SSTF Disk Scheduling Algorithm SCAN and C-SCAN Disk Scheduling Algorithm Look and C-Look Disk Scheduling Algorithm File in Operating System File Access Methods in Operating System File Allocation Method Directory Structure in Operating System N-Step-SCAN Disk Scheduling Feedback Queue in Operating System Contiguous Memory Allocation in Operating System Real-time Operating System Starvation in Operating System Thrashing in Operating System 5 Goals of Operating System Advantages of Operating System Advantages of UNIX Operating System Bit Vector in Operating System Booting Process in Operating System Can a Computer Run Without the Operating System Dining Philosophers Problem in Operating System Free Space Management in Operating System Inter Process Communication in Operating System Swapping in Operating System Memory Management in Operating System Multiprogramming Operating System Multitasking Operating Systems Multi-user Operating Systems Non-Contiguous Memory Allocation in Operating System Page Table in Operating System Process Scheduling in Operating System Segmentation in Operating System Simple Structure in Operating System Single-User Operating System Two Phase Locking Protocol Advantages and Disadvantages of Operating System Arithmetic operations in binary number system Assemblers in the operating system Bakery Algorithm in Operating System Benefits of Ubuntu Operating System CPU Scheduling Criteria in Operating System Critical Section in Operating System Device Management in Operating System Linux Scheduler in Operating System Long Term Scheduler in Operating System Mutex in Operating System Operating System Failure Peterson's Solution in Operating System Privileged and Non-Privileged Instructions in Operating System Swapping in Operating System Types of Operating System Zombie and Orphan Process in Operating System 62-bit operating system Advantages and Disadvantages of Batch Operating System Boot Block and Bad Block in Operating System Contiguous and Non - Contiguous Memory Allocation in Operating System Control and Distribution Systems in Operations Management Control Program in Operating System Convergent Technologies in Operating System Convoy Effect in Operating System Copy Operating Systems to SSD Core Components of Operating System Core of UNIX Operating System Correct Value to return to the Operating System Corrupted Operating System Cos is Smart Card Operating System Cosmos Operating Systems Examples Generation of Operating System Hardware Solution in Operating System Process Control Block in Operating System Function of Kernel in Operating System Operating System Layers History of Debian Operating Systems Branches and Architecture of Debian Operating Systems Features and Packages of Debian Operating Systems Installation of Operating System on a New PC Organizational Structure and Development in Debian Operating Systems User Interface in Operating System Types Of Memory in OS Operating System in Nokia Multilevel Paging in OS Memory Mapping Techniques in OS Memory Layout of a Process in Operating System Hardware Protection in Operating System Functions of File Management in Operating System Core of Linux Operating System Cache Replacement Policy in Operating System Cache Line and Cache Size in Operating System What is Memory Mapping? Difference Between Network Operating System And Distributed Operating System What is the difference between a Hard link and a Soft Link? Principles of Preemptive Scheduling Process Scheduling Algorithms What is NOS? What is the Interrupt I/O Process? What is Time Sharing OS What is process termination? What is Time-Sharing Operating System What is Batch File File system manipulation What is Message-passing Technique in OS Logical Clock in Distributed System

SJF Scheduling in OS

Shortest Job First (SJF) Scheduling in OS

Shortest Job First is a Preemptive or Non-Preemptive algorithm. In the shortest job first algorithm, the job having shortest or less burst time will get the CPU first. It is the best approach to minimize the waiting time. It is simple to implement in the batch operating system because in this CPU time is known in advance, but it is not used in interactive systems, because in interactive systems, CPU time is not known.

Characteristics of Shortest Job First Scheduling

  1. SJF algorithm is helpful in batch operating where the waiting time for job completion is not critical.
  2. SJF improves the throughput of the process by ensuring that the shorter jobs are executed first, thus the possibility of less turnaround time.
  3. SJF enhances the output of the job by executing the process, which is having the shortest burst time.

Advantages of Shortest Job First (SJF) Scheduling

The advantages of Shortest Job First scheduling are:

  1. SJF is basically used for Long Term Scheduling.
  2. The average waiting time of Shortest Job First (SJF) is less than the FCFS (First-Come, First Serve) algorithm.
  3. For a particular set of processes, SJF provides the lowest average waiting
  4. In terms of the average turnaround time, it is optimal.

Disadvantages of Shortest Job First (SJF) Scheduling

  1. In SJF process completion time needs to be known earlier. Although prediction is difficult.
  2. Sometimes the problem of starvation occurs in SJF.
  3. SJF needs the knowledge to know how long a process will run.
  4. It is not easy to know the upcoming CPU request length..
  5. In SJF, it is necessary to record elapsed time, resulting in more overhead the processor

Types of Shortest Job First (SJF) Scheduling

There are two types of Shortest Job First Scheduling.

  1. Non-Preemptive SJF
  2. Preemptive SJF

If the processor knows the Burst time of the processes in advance, the scheduling of the process can be implemented successfully. But practically it’s impossible.

When all the processes are available at the same time, then the Shortest Job Scheduling algorithm becomes optimal.

  1. Non-Preemptive SJF: - In Non-Preemptive Scheduling, if a CPU is located to the process, then the process will hold the CPU until the process enters into the waiting state or terminated.

Example of Non-Preemptive SJF Scheduling:

In the following example, we have 4 processes with process Id P0, P1, P2, and P3. The arrival time and burst time of the processes are given in the following table.

 Process ID  Burst Time  Arrival Time Completion time Waiting Time Turnaround Time
 P0 8 5 21 8 16
P1 5 0 5 0 5
P2 9 4 16  3 12
P3 2 1 7 4 6

The waiting time and turnaround time are calculated with the help of the following formula.

         Waiting Time = Turnaround time – Burst Time

          Turnaround Time = Completion time – Arrival time 

Process waiting time:

P0= 16-8=8

P1= 5-5=0



Average waiting time= 8+0+3+4/4



Process turnaround time:





Average turnaround time=16+5+12+6/4



SJF Scheduling

Preemptive SJF Scheduling: - In this, jobs are moved into the ready queue when they arrive. Those Processes which have less burst time begins its execution first. When the process with less burst time arrives, then the current process stops execution, and the process having less burst time is allocated with the CPU first.

Example of Preemptive SJF Scheduling: In the following example, we have 4 processes with process ID P1, P2, P3, and P4. The arrival time and burst time of the processes are given in the following table.

Process   Burst time Arrival time Completion time Turnaround time Waiting time
P1 18 0 31 31 13
P2 4 1 5 4 0
P3 7 2 14 12 5
P4 2 3 7 4 2

The waiting time and turnaround time are calculated with the help of the following formula.

         Waiting Time = Turnaround time – Burst Time

          Turnaround Time = Completion time – Arrival time 

Process waiting time:





Average waiting time= 13+0+5+2/4


Process Turnaround Time:





Average turnaround time= 31+4+12+4/4

The GANTT chart of preemptive shortest job first scheduling is:

SJF Scheduling