Shortest Job First Scheduling (Solved Problem 1)

Показать описание

Operating System: First Come First Serve (FCFS) Scheduling Algorithm in OS.
Topics Discussed:
A solved problem on the Shortest Job First (SJF) or Shortest Remaining Time First (SRTF) Scheduling Algorithm from GATE (CS) 2014 Paper.

Music:
Axol x Alex Skrindo - You [NCS Release]

#OperatingSystemByNeso #OperatingSystem #SJF #SchedulingAlgorithms #os

Рекомендации по теме

Комментарии

The algorithm shown here is Shortest Remaining Time First (SRTF) not Shortest Job First (SRF). In description it's written that both are same which is not true. SJF is a non-preemptive algorithm while SRTF is preemptive at arrival. I am referring Operating Systems Internals and Design principle by William Stalling. There may be a mistake due to very similar names.

neel_artstrong

Sir, I understand what you taught very clear. I applied it to solve my test questions and my lecturer said it was wrong. With tons of evidences & references, he still insisted that my solution is WRONG. Almost everyone in the class solved it by referring to ur video.
How a frustrating learning process :( Anyway, I believed you are the right one.

chrismalingshu

Just wish my professor could teach like this...

yusen-t_t

Just wish my professor could teach like

pranavbadhe

you guys are the reason im gonna graduate college

giannawilliams

SJF and SRTF are different. SJF holds for preemptive mode while SRTF holds for non-preemptive process (arrival time)

ayushiyadav

This is not SJF algorithm. This is Shortest Remaining Time First algorithm. In case you are wondering what is the correct SJF, when a proccess starts, you dont compare any proccess that comes next, but instead let it finish no matter what. Correct your video's title or the description, because it misleads students.

lofiking

Sir the title is bit confusing as it is Shortest Remaining Time First (SRTF) or preemptive SJF not just Shortest Job First (SJF) as the initial thing that comes in mind after hearing SJF is non-preemptive because what you are doing here is preemptive scheduling but generally SJF is non-preemptive in arrival

nilawmanandhar

This was extremely clear and helpful. Many thanks.

lolz

Sir you should write in title it's preemptive shortest job first 😑

proteanguy

hey! I have a question. how do I calculate waiting time if (for example) P1 was 3 times processed?

shade

Sir here if we calculate TAT for P1 it is coming out to be 27 using (CT-AT) formula but when we are calculating WT using (TAT - BT) formula then WT is coming different as compared to (TWT- Execution previous in millisecond - AT) formula. Theoretically TAT should be 27 only

PKMKB

Sir how these actually happens in cpu how it knows or estimate the burst time of the process

arashpardeepsingh

Hello sir, I think P4 intrerrupts P3 since 5 is less than 6

unlockwithjsr

Excuse me sir since p4 has a smaller burst time than p3 why didn't it come first...

tajudeenlisa

Sir how can i deal the theory part of OS??

greythirdeye

it is for preemptive and u solve it for non preemptive schedeuling

trendtidetv

SIR IT'S YOUR MISTAKE THAT SHORT JOB FIRST SCHEDULING IS A NON-PREEMTIVE MODE AND IN THIS MODE EACH PROCESS IS EXECUTED UNTIL IT FINISHED

rittushsarkar

Shortest Job First Scheduling (Solved Problem 1)

Shortest Job First Scheduling (Solved Problem 1)

Shortest Job First Scheduling (Solved Problem 2)

Shortest Job First (SJF)

Scheduling Algorithms - Shortest Job First (SJF)

Shortest Job First (SJF) Scheduling Algorithm With Example | With Arrival Time | Operating System

L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating System

short job first Preemptive

L3. Shortest Job First (or SJF) CPU Scheduling

Shortest Job First (SJF) - Non Pre Emptive CPU Scheduling Algorithm - Operating Systems

SJF CPU Scheduling Algo Preemptive

CPU Scheduling Algorithm- Shortest Job First Introduction

Operating Systems | C4-L8 | Preemptive SJF scheduling

CPU Scheduling Algorithm- Shortest Remaining Time First

Shortest Remaining Time First (SRTF)

Shortest Job First (SJF) | #Betriebssysteme

Shortest Remaining Time First (SRTF) Scheduling Algorithm | SJF With Preemption | Example

L-2.5: Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example | OS

Non-preemptive SJF scheduling algorithm

SHORTEST JOB FIRST(SJF) PREEMPTIVE AND NON-PREEMPTIVE CPU SCHEDULING ALGORITHM| OPERATING SYSTEM

Shortest Job First Scheduling Algorithm || SJF || Shortest Process Next || SPN || Non Preemptive| OS

OS Preemptive Scheduling: SJf(short-job-first)

SJF CPU Scheduling Algorithm

OPERATING SYSTEM - SJF Preemptive ( Shortest Job First )

L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example