Shortest Remaining Time (SRT) CPU Scheduling Algorithm - Operating Systems
HTML-код
- Опубликовано: 21 окт 2024
- Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
--------------------------------------------------------------------------------------------- In this Video Tutorial we will Study and learn the working of Shortest Remaining Time CPU scheduling algorithm (SRT). SRT as the name suggests is based on the principle of shortest remaining time.
It is a variation of SJF with Pre-Emption. Thus SFJ with Pre-Emption is Know as SRT (shortest remaining time). Pre-Emption is the capability of the CPU to pause/stop the execution of a process before completion and swtich between different processes depending on certain criteria.
First Come First Serve (FCFS) CPU Scheduling Algorithm: • First Come First Serve...
Shortest Job First SJF CPU scheduling algorithm: • Shortest Job First (SJ...
Round Robin CPU Scheduling Algorithm (RR) : • Round Robin CPU Schedu...
Priority Based CPU Scheduling Algorithm : • Priority Based CPU Sch...
Simple Snippets Official Website -
simplesnippets...
Simple Snippets on Facebook-
/ simplesnippets
Simple Snippets on Instagram-
/ simplesnippets
Simple Snippets Google Plus Page-
plus.google.co...
Simple Snippets email ID-
simplesnippetsinfo@gmail.com
For Classroom Coaching in Mumbai for Programming & other IT/CS Subjects Checkout UpSkill Infotech - upskill.tech/
UpSkill is an Ed-Tech Company / Coaching Centre for Information Technology / Computer Science oriented courses and offer coacing for various Degree courses like BSc.IT, BSc.CS, BCA, MSc.IT, MSc.CS, MCA etc.
Contact via email /call / FB /Whatsapp for more info
email - upskillinfotech@gmail.com
We also Provide Certification courses like -
Android Development
Web Development
Java Developer Course
.NET Developer Course
Hey Guys, if you want many more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends ✌
I personally than u bro.. Ur an xcellent teacher ill definitely pass in my xam... Tnq so much... I wish u to make more videos like this and educate us..!
My guy, keep it up I have been looking at tons of videos trying to understand this algorithm thank u bruh
Most welcome buddy 🤟 I'm glad you liked this video. I would request you to please share the video with your friends too 😊
THIS IS VERY HELP FULL ..ND THE MOST IS I DONT NEED TO REMEBRE FORMULA THANK YO
+Divya Gohil you're welcome buddy ✌😎
Thanks a lot man . you have explained this very well .
Most welcome buddy. I would request you to please share the video with your friends and contacts too 😇✌️
That will be the most helpful thing ✌️
the best explanation is released from you!
Thank you so much for this video.
Its very easy to understand
Thank you so much 🥺🥺
good explaination! thanks you
Bro you rocked
Got to top in my CT tommorow At least in numericals
All the best buddy. Thanks for the postive response :)
Why did you add 4 to p3? Aren't you supposed to add only 2 then p3 again?
Nice video, but I have a doubt, which is, every process has started in gnatt chart at their arrival time but why p3 not started at its arrival time
Because lowest the AT first priority will be given to that
Thanks man! It helped a lot.
p.s. I think things would be more visible and clear if you have used a white background instead of black.
Thank you for the positive response buddy 😇
Glad you liked the video. Please do share it with your friends and contacts. That'll be very helpful ✌️
And yes the reason why I use black background is cause in educational videos, students tend to get highly engrossed sitting in front of the screen for longer durations. Now it's been proved that a dark screen puts less stress on our eyes especially during low light and night times. So that's the main reason. Also I kinda think the neon colors are cool. Trying to follow Khan Academy in a way. ✌️😇
@@SimpleSnippets ye perfect
Thanks buddy 😇✌️
Love you bro ! Keep up the good work
Most welcome my friend 😊
Super happy to hear this from you. My only request is please share this video with your friends too ✌️ that will be the biggest help for the channel 😊✌️
Already shared it with my buddy's 😊
Thank you so much ✌️
This is the best support 😊
I don’t know why I’m not getting this one🤦🏽♀️
too good teacher!!!
Thank you so much buddy 😊 please share the videos with your friends too 🙏
Sure sir ill share your videos ☺️
@@prajwalmore7554 glad to hear this 😊
What if: the running process remaining time is exactly same as the process that is next in the queue with exact same Burst time. Will it consider the new Process or will it continues on the same to finish ???
Thank You
Thank your sir
Hey man! Cool video, but I still do have a question. How does the system know both the arrival time and burst time? For an arival time do i need in my program some global clock running, or what? And for burst time... How am I supposed to give each process it's default time?
This is a numerical, and this is usually how data is presented in an examination scenario. If you are talking about the real implementation of this scenario in terms of programming or in a real CPU system with this algorithm then there are many factors to be taken into consideration.
Simple Snippets Hahah yea, that's exactly what i mean. At my university we're building our system simmulation and I have to schedule processes using SRT, which is fine, I implemented it already. The thing is we don't know where to get the burst time of the process. I know there's equation newPredictionBurstTime = a * whole time + (1-a) * lastPredictedBurstTime But does this equasion make the burst time of next process? What if the process arrives while the very first is being run, then we don't know the burst time of the second one...
what if 2 proces needs 2 seconds each, 1 was paused earlier then and 1 just arrived, will it complete the 1 that was paused or the 1 that just arrived?? answer pls
Computing turn around time directly seeing grant chart ..... everything is correct except for p3 ...just check it out .... 11-7=4 bt u had written 6
11-7 + (2 waited time ) = 6 .
but good question
Plz avoid writing with pink colour. It is very helpful video but due to pink colour it is not much visible
Okay, Thank you for the suggestion. Will surely keep this in mind in upcoming videos ✌😇
Bro in SRT time slice is required or not ?
+singani anji I don't think so time slice concept applies here. That applies in round robin. Here the concept of shortest job along with preemption applies ✌
But you used 2 units of time for a process how ?
but why did you took 2 seconds initially ??
How to take arrival time and burst time
You don't have to take them. Usually in exams it's given ✌️
thanks
i guess through this video ill pass ma exams in this topic its meant a lot thanks #simple snippets (*!*) :)
All the best buddy. Please do share the videos with your friends and contacts too 🙂
It's wrong, P1s burst time is 4 so check your chart.
Hey him I just checked the video, i'm sure I have not made any mistake here. Can you elaborate where exactly you think something is wrong ?
@@SimpleSnippets P2 has the shortest BT than P1 so it should come after P0.
You should be bit slower while explaining, not all students are capable of understanding at this speed
I agree, I am sorry. Will keep this in mind !
turn the intro volume down 🙁
You talk so very fast😢
Totally invisible video
Maybe watch in 720p. Sorry for the inconveniences though ✌️