Shortest Job First Scheduling (Solved Problem 2)

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

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) 2016 to find the average turnaround time for a set of processes.

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

#OperatingSystemByNeso #OperatingSystem #SJF #SchedulingAlgorithms #os

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

Комментарии

As we know waiting time=total waiting time- no of milisecond process execute before-AT but p2 runs three time where we take no of miliseond process execute before for p2 first time it runs or second time

UnlockWave

please make more videos sir like memory management, please, you are the only hope for me in operating system 🙏🙏❣️❣️

hermione

can u make vedio on how to solve if 4 process are given and one the burst times are varible and avg waiting time is given
for premitive sjf algo

mohith

Thank you sir humble request upload more os lecture..

ClickSonic

Sir, In 8 time units, when the arrival time of the P4 is 8 time units, P2 was chosen instead of P4 because the burst time of P2 is less, right? Is that possible ? But think so, P3 has the least burst time. If so, should P3 happen first, regardless of arrival time? If not, is there something wrong with 8 time unit? Sir, can you explain this?

slprochannel

Sir as the name suggests shortest job first then we should take those jobs which have less burst time instead of more more burst time.

thedazzlingqueen

Thank you mate, your videos really help me studying. Do you plan on making videos about Memory Management also?

elgasplatte

how is Turnaround time for P4 13-8 =5? shouldn't it be 13-10=3?

JunaidKhan

Shortest Job First Scheduling (Solved Problem 2)

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

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

L3. Shortest Job First (or SJF) CPU Scheduling

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 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

OPERATING SYSTEM - SJF Preemptive ( Shortest Job First )

Example of Preemptive SJF(Shortest Job First) [English]

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

SJF CPU Scheduling Algorithm

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