Scheduling Algorithms - Shortest Job First (SJF)

Подписаться 2,6 млн

Просмотров 333 тыс.

50% 1

Operating System: Shortest Job First (SJF) Scheduling Algorithm in OS.
Topics discussed:
1) Shortest Job First (SJF) Scheduling Algorithm.
2) Non-Preemptive Shortest Job First (SJF).
3) Preemptive Shortest Job First (SJF).
4) Calculation of Average Waiting Times for Non-Preemptive and Preemptive Shortest Job First (SJF) Algorithms.
5) Problems with Shortest Job First (SJF) and approaches to address those problems.
Follow Neso Academy on Instagram: @nesoacademy (bit.ly/2XP63OE)
Follow me on Instagram: @jaiz_itech (bit.ly/2M3xyOa)
Contribute: www.nesoacademy.org/donate
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy.org/recommende...
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#OperatingSystemByNeso #OperatingSystem #SJF #SchedulingAlgorithms #os

Опубликовано:

30 июн 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 85

@chulbuli_titli 4 года назад

Thank you for watching and see you in the next one.

@nisharathod2945 3 года назад

thanks for providing us with so good lectures for free, God bless you!

@alexandraxu7643 4 года назад

Very helpful, watched from the begining, thank you for doing this vid, please continue with this topic!

@hacaneh4508 4 года назад

only few people finish this series. like if you came all the way from 1 to 43

@vrajparikh8630 2 года назад

wtf you talking about i finished it in 2 days

@kornelijussliubauskas8299 2 года назад

@@vrajparikh8630 and remembered nothing

@minhhoangcong9155 Год назад

@@vrajparikh8630 wtf how, i took 2 weeks to get here, you didnt even try to absorb the knowledge did u ?

@DaiMoscv Год назад

at 11:00 FCFS solution: Assuming arrival time = 0 for all of them, therefore, we start from P1 until P4 in order. ID C/T T/T W/T B/T P1 6 6 0 6 P2 14 14 6 8 P3 21 21 14 7 P4 24 24 21 3 C/T - completion time, T/T - Turnaround Time, W/T - Waiting Time, B/T - Burst Time, A/T - Arrival Time T/T = C/T - A/T W/T = T/T - B/T Average W/T = (0+6+14+21)/4 = 10.25 milliseconds.

@rashmipurad9243 11 месяцев назад

Sir 0+6+14+21=41 41/5=8.2ms How come 10.2

@pvkvlogs5299 11 месяцев назад

Sir you have to divide 41 by 4 . Because there is only 4 process. But you are dividing 41 by 5 that's why you are getting wrong answer

@franciscrypto9143 Год назад

I LOVE YOU MAN! YOUR DISCUSSION IS THE SAME WITH MY PROF WHO DON'T EXPLAIN EVERYTHING THOROUGHLY

@Rishi-nv7bp 4 года назад

thank you for uploading this. looking forward to future videos in this series. pls upload asap.

@supriyayj 4 года назад

Very easy and simple explanation... Superb sir.. Thanku

@mokera3801 4 года назад

Awesome explanation

@gyasisturgis8955 2 года назад

Thank you! This was a great explanation

@usamayousaf1847 3 года назад

Thank you for the hard work... Really appreciated

@vivektheachillean 4 года назад

Kindly add more videos in this series of scheduling .If you could do it at the earliest.

@DalipsinghSingh-uz5uk 3 года назад

Reflects ur knowledge highly 💯✨

@vinayakash299 Год назад

You just nailed it man !!! Thank you so much

@rohinimv3412 3 года назад

Thank you. Good explanation. Plz cover all the topics in OS

@yunicoardianpradana7288 4 года назад

thank for the explanation .... its vers clearly ......

@saddamahmad2310 4 года назад

thank you very much sir for this video

@venkataiahgundae239 4 года назад

Sir please complete course as soon as possible

@Pr3kashSingh 4 года назад

Superb question

@srihariyallala8468 4 года назад

Thanks a lot sir

@FlamyBruh 3 года назад

The way u say 'Gantt Chart' it sounds like something else. LOL :)

@adnan7698 2 года назад

Chart kahan hai!!?? Gantt mein daal liye ho kya chart sala sab? Ab kaise?...

@kirthivino6357 2 года назад

Thank you so much sir...! 👍🏻

@gatecomputerscience1484 2 года назад

Thanks sir for your knowledge

@nishithamuthuluru7636 4 года назад

Superb keep uploading your videos

@aleinadmay9807 Год назад

Thank You for this❤️

@ndaghakangoma9153 3 года назад

best explanation

@akashkamble224 4 года назад

Sir please complete the course. Thanks you

@assulaimi7973 Год назад

Hi Neso, thank you for teaching us valuable information, is (SJF) has the same meaning of (SSTF) algorithm ?? Many thanks

@Ahmed_Alaini 4 месяца назад

Thank you so much

@phasicaweldelul1119 3 года назад

thanks so much

@sagar83205 3 года назад

Tnk u so mch

@TuanNguyen-rx1vf 3 года назад

thanks for ur video

@wisdommatthew6775 2 года назад

Thanks 🙌

@prernagarg5892 3 года назад

Sir, my All doubt are clear regarding SJFS .

@trywellwashington7506 4 года назад

22:46 maybe 'total waitin gtime' could be described as 'start time'

@SadhanaRd 2 года назад

Thank you so much sir 😌😌

@lucakagwe 2 года назад

thankyou sir for your help

@dhanushsivajaya1356 3 года назад

Thankyou sir

@adityasaini8437 Год назад

@Neso Academy hello sir, i am not able to understand the disadvantages you tell in last, can you give a brief example on it , i mean we have covered both ways easily so what issue left

@ayushiyadav1 Месяц назад

THANKSS

@juanfernandez1504 2 года назад

Instead of calculating waiting time with the formula in this video, I used the previous formula from the FCFS video which is: Waiting Time = Turnaround Time - Burst Time And I actually got the same answer of 6.5 units. Is this just a coincidence or will that formula always work for SJF as well?

@yagzceylan4878 2 года назад

No it's not a coincidence, that formula also works for every scheduling algorithms.

@pragyarupsi1594 8 месяцев назад

Sir so nice teaching and very easy sloveing questions ❤❤❤❤❤❤❤❤

@kavishkanilan9137 2 года назад

nice!!!!!!

@priteshsahu8645 6 месяцев назад

Do we know beforehand after what time the process would be stopping for an i/o operation?

@omarb155 Год назад

Does process scheduling have a lot of practical use for programmers?

@kunjupulla Год назад

How can you know the burst time without running the process at least once?

@muhammedimdaad 5 месяцев назад

have the same question

@user-kr4zt1xt2j Месяц назад

Assumptions bro

@musicmaniacs7978 Год назад

hi sir ...your video lectures was nice...will your share your slides sir....my humble request

@t2gamerz4 Месяц назад

better than sir faisal cheema thank u

@pragyarupsi1594 8 месяцев назад

Sir please PCV topic teaching ❤❤

@bachelorcookingchannel3165 2 года назад

If they give process time only how can we calculate the program clarify my doubt

@shwetashaiva4307 2 месяца назад

If arrival time is not given , could we assume arrival time as 0 or it could be compute from Gantt chart?

@shilpamaddi2510 3 года назад

👍👍👍

@arpitanand4248 3 года назад

It's name should be "Shortest Approximate Remaining Next CPU Burst First Algorithm"

@moviesnight248 4 года назад

I heard NESO is hiring developers. Can u send me the link to register?

@moviesnight248 4 года назад

@@nesoacademy Thank you sir.

@user-lm3zy2sk4i 6 месяцев назад

How to get the burst time?

@criminalcoder6307 3 года назад

Gantt chart

@brightontandabantu 3 года назад

Who has calculated the average waiting time using FCFS algorithm? I got an average waiting time of 8.75

@brightontandabantu 3 года назад

NVM I had missed the assumption that all the processes are assumed to have arrived at the same time!

@pragatibatra5394 Год назад

hi sir please tell me how waiting time will be calculated when we are not given with arrival time in FCFS . (11:00)

@chakradharthota1100 Год назад

Not possibe because FCFS primarily depends on arrival time

@KM-sf6zy 10 месяцев назад

calculated as per the process id

@chheangthina1266 14 дней назад

I don't understand about preemptive so explain not clear about point 16:38

@yashopmukhia5115 Год назад

if sjf is preemptive then what is srtf then?

@GAMER_KA-13 Год назад

SJF [ preemptive ] and SRTF is same SJF [ non preemptive ] is different

@mantubhattacharya6238 3 года назад

10:50 How can we find through FCFS arrival time is not given?? Please help

@minaahmadprovisionaladmiss3707 3 года назад

Same question bro

@amoghchavan7893 3 года назад

He taught that in previous lecture.

@mukheemmohammed6756 3 года назад

processes have less process id will be given the cpu first. so the order will be p1,p2,p3,p4.

@gerwinterpstra8698 3 года назад

He said at 9:05 that we assume that the processes arrived at the same time (arrival time =0).

@lynnm2962 2 года назад

@@mukheemmohammed6756 thank you

@maqsoodmemon7212 3 года назад

gaaand chart!!!

@lesterprobadora5995 3 года назад

Mam z

@Shivam-kz2dg 10 месяцев назад

Ain't it "Shortest remaining time first" ???