2.2.3 SJF Shortest Jon First Process/CPU Scheduling Algorithm in Operating System with example

Описание к видео 2.2.3 SJF Shortest Jon First Process/CPU Scheduling Algorithm in Operating System with example

In SJF shortest job first scheduling which process has shorter burst time that process will serve first.
In FCFS first come first serve scheduling what ever the process arrives first it will be serve first.

There are four types of scheduling algorithm
FCFS First come first serve scheduling
SJF Shortest job first scheduling
Priority scheduling
Round robin scheduling

Some how it is known as process scheduling also.
There are to types of scheduling in process.
Preemptive scheduling and Non-preemptive Scheduling.

There are three types of scheduler
Long Term Scheduler
Short Term Scheduler
Medium Term Scheduler

Long term scheduler bringing process from new state to ready state.
Short term scheduler allocating CPU to process for start execution from ready state.
Medium term scheduler is responsible for swapping of process.

State transition diagram representing that how process moving from one state to another state during execution.

States of Process are New, Ready, Run, Terminate, Wait or Block, Suspended wait and Suspended ready. When process moving from run state to ready state and ready state to run state, it is known as context switching. When process moving waiting or block state to suspended wait, it is known as swapping of process.

Process Control Block known as PCB, It carry attributes like Process ID, Program Counter, Process State, Priority of process, General Purpose Resisters, List of open files, List of open devices, Protection etc.

Parameters of process like : Arrival Time, Response Time, Burst Time, Completion Time, Turn Around Time, Waiting Time.

Program made by line of code or set of instruction. When operating system runs this program it becomes a process.

Process in memory
Text field carry executable code compiled by the compiler,
Data field carry static and global variable,
Heaps for memory allocation dynamically,
Stack storing temporary data like function parameters and return address.

Characteristics
Process is an active entity,
Process has shorter life time,
Process requires resources to run,
Process executes in memory.

1 What is Process
   • 2.1.1 What is Process in operating sy...  

2 Process Control Block
   • 2.1.2 Process Control Block in Operat...  

3 State Transition Diagram
   • 2.1.3 State Transition Diagram in ope...  

4 Methods handling deadlock
   • 6.1.4 Methods for handling a deadlock...  

5 Types of Scheduler
   • 2.1.4 Scheduler in Operating System w...  

6 CPU Scheduling
   • 2.1.4A CPU Scheduling in operating Sy...  

7 Scheduling Algorithm
   • 2.2.1 Scheduling algorithm in operati...  

8 FCFS CPU/Process Scheduling
   • 2.2.2 FCFS Process/CPU Scheduling Alg...  

9 Convoy effect og FCFS
   • 2.2.2A Convoy effect for FCFS Process...  

10 SJF CPU/Process Scheduling
   • 2.2.3 SJF Shortest Jon First Process/...  

11 SJF Limitation
   • 2.2.3A Limitation of SJF Shortest Jon...  

12 Non preemptive Priority CPU/Process Scheduling
   • 2.2.4 Non preemptive priority Process...  

13 Preemptive Priority CPU/Process Scheduling
   • 2.2.4A Preemptive priority Process/CP...  

14 Round Robin CPU/Process Scheduling
   • 2.2.5 Round Robin CPU/Process schedul...  

Комментарии

Информация по комментариям в разработке