No video

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

  Рет қаралды 138,628

Sudhakar Atchala

Sudhakar Atchala

4 жыл бұрын

shortest job first scheduling program in c,
priority scheduling algorithm,
shortest job first scheduling program in c++,
shortest job first scheduling program in java,
sjf preemptive scheduling program in c,
sjf preemptive scheduling example,
preemptive sjf scheduling example ppt,
shortest job first real life example,

Пікірлер: 63
@ajayadithya952
@ajayadithya952 Ай бұрын
P4 burst time is less than all the process then why you have taken po process first
@SudhakarAtchala
@SudhakarAtchala Ай бұрын
At A.T 0 only p0 in ready queue. So, cpu completed p0 execution.now completetion time is 3 . At 3 only P1 in ready queue, i.e P2, p3, p4 are not in ready queue. Hope ur doubt clarified.Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@maneeshadesetty1991
@maneeshadesetty1991 Ай бұрын
As you said we have to check shortest burst time then p4 has burst time 2 then you have taken p0
@likithareddylikky1198
@likithareddylikky1198 2 жыл бұрын
Thanks for every video sir after completion of my exams I will share with all my contacts to subscribe... Now I completed 75% of syllabus because of you .. It is very easy to understand😉
@SudhakarAtchala
@SudhakarAtchala 2 жыл бұрын
Many many thanks please share it
@aggipettiundhamama6217
@aggipettiundhamama6217 3 жыл бұрын
Nice video sir, understood very well
@SudhakarAtchala
@SudhakarAtchala 3 жыл бұрын
Glad to hear that ledu aggi petta. Plz subscribe to the channel and if possible share with your friends. Thanks
@navyasrimuthireddy9661
@navyasrimuthireddy9661 3 жыл бұрын
Sir meru shortest burst time will be executed first Ani chepparu kadha Mari problem lo p0 having 3 and P1 having 6 kadha sir mari Gantt chart lo p0 tarvatha P1 ni arrive chesaru enti sir p0 having 3 but shortest job first is p4 that having burst time 2only p4ni p1tarvatha arrive chesaru Mari sjf antey processes which is having shortest burst time ani chepparu kadha pls answer my question sir....
@SudhakarAtchala
@SudhakarAtchala 3 жыл бұрын
At A.T 0 only p0 in ready queue. So, cpu completed p0 execution.now completetion time is 3 . At 3 only P1 in ready queue, i.e P2, p3, p4 are not in ready queue. Hope ur doubt clarified Navya. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@killer4791
@killer4791 Ай бұрын
To whoever who is confused as of to why, after P0, the p1 process is taken in consideration, the reason is as follows : "Firstly, at 0th second, only one process is available in the ready queue, which is p0. So, p0 will be executed first. Secondly, the time taken i.e Burst time for the p0 i.e the total time taken to complete the execution of p0 process is 3 seconds. So, in these 3 seconds of execution, look at the arrival times column. Which process has loaded into the ready queue during the 3 seconds? Only p1 process is there in the ready queue in the 3 seconds. That is why, p1 process was considered and not p4. Because, look at p4's arrival time. It is going to arrive into the ready queue at 8th second, but only 3 seconds have been passed. To make it simpler for you to understand what is going on, think about two scenarios happening simultaneously "In your left, there is ready queue. In this ready queue, the process are being loaded. In your right hand, the CPU is being assigned to the Process from the left hand, and being executed. During the time when the CPU executes the process, the processes continue to be loaded into the left hand i.e ready queue" I hope I have put it in more sensible words and in more simpler words for you to understand and I hope that I have cleared your doubt. Gimme a like if I did :> And aswell, thank you sir.
@SudhakarAtchala
@SudhakarAtchala Ай бұрын
Nice. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@potnurukanakarao5003
@potnurukanakarao5003 2 жыл бұрын
You're Teaching is awsome sir. Belive me, You are helping a lot of students For better scorings in their examinations. Already subscribed your channel from 2 accounts. Thankyou For all your lectures.
@SudhakarAtchala
@SudhakarAtchala 2 жыл бұрын
Welcome
@G_Abhi
@G_Abhi 6 ай бұрын
very Good explanation sir
@SudhakarAtchala
@SudhakarAtchala 6 ай бұрын
Thanks and welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@dharanidharani2496
@dharanidharani2496 Жыл бұрын
Thanks a lot sir no more words to express my gratitude sir 🥺✨
@SudhakarAtchala
@SudhakarAtchala Жыл бұрын
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@vineethatummala2511
@vineethatummala2511 Жыл бұрын
But p4 has least burst time than p1.then why did you consider p1 first?
@SudhakarAtchala
@SudhakarAtchala Жыл бұрын
What about Arrival times ? Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@speci1119
@speci1119 2 жыл бұрын
Sir tqsm Ur teaching was best n we r getting better way than our cls lectures 😇tqsm
@SudhakarAtchala
@SudhakarAtchala 2 жыл бұрын
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@runallinonechannel4732
@runallinonechannel4732 2 жыл бұрын
P1 burst time is high compare to others then y taken sir
@likithareddylikky1198
@likithareddylikky1198 2 жыл бұрын
At first we have to take in at then ...2
@likithareddylikky1198
@likithareddylikky1198 2 жыл бұрын
I think you got logic...?
@OurProblemsOurSolutions
@OurProblemsOurSolutions 3 ай бұрын
Informative
@SudhakarAtchala
@SudhakarAtchala 3 ай бұрын
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@felipegalvezcarrasco7834
@felipegalvezcarrasco7834 3 жыл бұрын
thank you teacher, greetings from Chile
@SudhakarAtchala
@SudhakarAtchala 3 жыл бұрын
Plz subscribe to our channel and if possible share with your friends. Thanks
@mugilan_sakthi
@mugilan_sakthi Жыл бұрын
Tq so much sir your teaching way good keep going sir
@SudhakarAtchala
@SudhakarAtchala Жыл бұрын
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@birukanley6171
@birukanley6171 2 жыл бұрын
I have been looking someone like you . you did it
@SudhakarAtchala
@SudhakarAtchala 2 жыл бұрын
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@VishnuVardhan-xd9jc
@VishnuVardhan-xd9jc 2 ай бұрын
Meeru cheppali anukuntunna content and explanation good sir. But meeru total english kaakundaa telugu lo kuda chepthey baaguntundhi sir. It my openion sir...
@SudhakarAtchala
@SudhakarAtchala 2 ай бұрын
Already I upload a video on this in my Telugu channel. refer that , type computer Pantulu operating systems. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@tiktikgoes9
@tiktikgoes9 8 ай бұрын
I just love your teaching sir!!!
@SudhakarAtchala
@SudhakarAtchala 8 ай бұрын
Glad to hear that. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@nitindhamale8789
@nitindhamale8789 2 жыл бұрын
Very good Explain sir !!
@SudhakarAtchala
@SudhakarAtchala 2 жыл бұрын
Thanks and welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@mangamurigayathri6727
@mangamurigayathri6727 3 жыл бұрын
Sir?? Can a sjf preemptive work if we r given a data without arraival time???
@SudhakarAtchala
@SudhakarAtchala 3 жыл бұрын
yes, we can preempt its work Gayathri. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@516maibu.jatoth8
@516maibu.jatoth8 2 жыл бұрын
Thank u sir....
@SudhakarAtchala
@SudhakarAtchala 2 жыл бұрын
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@516maibu.jatoth8
@516maibu.jatoth8 2 жыл бұрын
Sure sir.....thank u
@kavii1696
@kavii1696 13 күн бұрын
Thankyou sir
@SudhakarAtchala
@SudhakarAtchala 10 сағат бұрын
Welcome. Please like the video, and share it with your friends. Thanks in advance.
@LeonArts
@LeonArts 4 жыл бұрын
Thank you man, but i've one problem that i can't solve, maybe you can help me: We have to use Shortest Process Next with aging technique, estimate the execution time of T3 knowing the previous T0, T1, T2: (some examples) 1. T0=10ms T1=30us T2=0,015ms 2. T0=200us T1=300ns T2=0,015ms 3. T0=0,05ms T1=30ns T2=40us
@user-rg4wo1uj8u
@user-rg4wo1uj8u 4 жыл бұрын
Thank You
@SudhakarAtchala
@SudhakarAtchala 4 жыл бұрын
Hai, plz go through my videos once. Definitely you will like more videos. Thanks for your encouragement and support towards our channel. Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.
@klaidanedeguzman8914
@klaidanedeguzman8914 3 жыл бұрын
thank you so much.. your better than my prof hahaha
@SudhakarAtchala
@SudhakarAtchala 3 жыл бұрын
You're welcome 😊 Klai Dane De Guzman. Plz subscribe to the channel and if possible share with your friends. Thanks
@AdeshShelar-qs5ct
@AdeshShelar-qs5ct 2 жыл бұрын
My question is in SJF non preemptive A.T is all 0 then Gantt chart is ?
@SudhakarAtchala
@SudhakarAtchala 2 жыл бұрын
Refer this video for srtf kzfaq.info/get/bejne/ismlrNVqlr_DgqM.html Then both sjf and srtf become same
@leelakrishnamohan519
@leelakrishnamohan519 Жыл бұрын
What if arrival time is non 0 then which will consider 1st
@SudhakarAtchala
@SudhakarAtchala Жыл бұрын
Refer to this video kzfaq.info/get/bejne/ismlrNVqlr_DgqM.html Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@ShirishaChawan
@ShirishaChawan 4 ай бұрын
Good teacher sir...but p1 have highest B.T compare to p4 then y taken p1 first
@SudhakarAtchala
@SudhakarAtchala 4 ай бұрын
But At O Arrival time , P4 doesn't exist in the ready queue(main memory). Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
@nithyareddyvlogs5946
@nithyareddyvlogs5946 17 күн бұрын
How can we know that the processes are in ready queue or not ? sir Plz reply i have exam tomorrow
@SudhakarAtchala
@SudhakarAtchala 16 күн бұрын
Ready queue contains list of processes ready for execution. initially all programs will be stored in hard disk i.. job queue and at the time of execution os loads the programs from hard disk to main memory ie ready queue.All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@kvnsivani3808
@kvnsivani3808 3 жыл бұрын
Thank u a lot sir 😊😊😊
@aishwaryaabburu
@aishwaryaabburu 20 күн бұрын
why have you taken p1 .....u said to write based on burst time right ....its burst time is 6 how is it possible
@SudhakarAtchala
@SudhakarAtchala 19 күн бұрын
plz read 1st comment reply. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@chiranthchiru5075
@chiranthchiru5075 Жыл бұрын
Sir y did you take p1 that have a highest burst time
@SudhakarAtchala
@SudhakarAtchala Жыл бұрын
It's a text book problem only. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Round Robin Scheduling Algorithm| Preemptive | Operating System  | OS
10:44
CHOCKY MILK.. 🤣 #shorts
00:20
Savage Vlogs
Рет қаралды 28 МЛН
Fast and Furious: New Zealand 🚗
00:29
How Ridiculous
Рет қаралды 48 МЛН
Running With Bigger And Bigger Feastables
00:17
MrBeast
Рет қаралды 79 МЛН
Shortest Job First(SJF) Scheduling Algorithm with example | Operating System
12:58
Jenny's Lectures CS IT
Рет қаралды 961 М.
OPERATING SYSTEM - SJF Preemptive ( Shortest Job First )
19:45
Sundeep Saradhi Kanthety
Рет қаралды 152 М.
OPERATING SYSTEM - SJF Non Preemptive ( Shortest Job First )
17:45
Sundeep Saradhi Kanthety
Рет қаралды 57 М.
Preemptive Priority Scheduling Algorithm|| Operating System  | OS
10:09
Sudhakar Atchala
Рет қаралды 89 М.