Thank You! So, the problems associated with priority scheduling are blocking and starvation while it's solution is aging. Starvation or blocking is when a process of low priority is made to wait for very long time or even indefinitely as all other processes arriving at cpu have more priority. In this case, processes waiting are helped in increasing their priorities to one unit after every single specific unit of time let's say after every 15min. In this case priority of process is increased and ultimately their priority gets higher than those new processes arriving at CPU. This phenomenon is known as aging and it is the solution of starvation in priority scheduling algorithm
I really appreciate the job you're doing and I have a question about the aging technique that increases the priority of a process with low priority more specifically about the time we should wait before the increase (15 minutes) isn't that too long?
I noticed that the priority in the example does not negatively related with the burst time. Is that pre-defined by some other mechanism not stated here? For example, how come the p4 have a low priority of 5, lower than p5(arriving late and has larger burst)?
Please many of the students need to learn these topics please make videos on topics on verilog hdl , structural and data flow modeling ,Design of combinational circuits structural and data flow modeling,Multiplexer, Application of Multiplexer, Verilog HDL Behavioural Modeling, Verilog HDL Testbench
Why are you indians always tediously showing every single step, even when its just adding numbers or decreasing 127 by 1? Not meant to be taken offensively but I noticed that in many videos and I think its really frustrating to watch sometimes, if you dont have a learning disability or something
skrt L. I have the same feeling but I understand why. Just like u find this video because ur professor skipped lots of steps of explanations that confused u, this gentlemen has to explain in details to ensure people with different levels of knowledge can all understand and get good grades in class.
Undoubtedly great skill you have, for the students who are not good in reading the text book for those kind of people you make it easy
Last moment saviour !!
You are doing a wonderful job sir
The confidence this channel give me as a CE student is insane. Thank you for everything.
Great work sir
Keep doing
Thanks teacher for this lecture
Thank You!
So, the problems associated with priority scheduling are blocking and starvation while it's solution is aging.
Starvation or blocking is when a process of low priority is made to wait for very long time or even indefinitely as all other processes arriving at cpu have more priority. In this case, processes waiting are helped in increasing their priorities to one unit after every single specific unit of time let's say after every 15min. In this case priority of process is increased and ultimately their priority gets higher than those new processes arriving at CPU. This phenomenon is known as aging and it is the solution of starvation in priority scheduling algorithm
@Gavin Decker yup, have been watching on instaflixxer for since december myself =)
The two years younger than me and
Great Teaching skills
thank you so much for this video. Helps me a lot!
God bless Sir!❤️
Sir, My all doubt are clear related to Priority scheduling.
Some good notes is in a ready queue
at 5:10 the priorities are given in question? or i should find them out
I really appreciate the job you're doing and I have a question about the aging technique that increases the priority of a process with low priority more specifically about the time we should wait before the increase (15 minutes) isn't that too long?
That is only for understanding in real life the algorithms are much more complex
I noticed that the priority in the example does not negatively related with the burst time. Is that pre-defined by some other mechanism not stated here? For example, how come the p4 have a low priority of 5, lower than p5(arriving late and has larger burst)?
the priority as the nverse of burst cpu, is i just an example of prioritie, so the example given is not related
Thankyou so much sir
What are the differences between non preemptive and preemptive priority scheduling sir hope u will notice my question thank you.
sir , service time means? Is it CPU time or I/O time
thank you
Sir is scheduling algorithm and process scheduling algorithm both are same
Thankyou sir
Kindly make videos on stack,linked list,heap,trees
sir ,the 1st problem that you've solved.... is it non preemptive or preemptive ???
Non preemptive
Please make a video on veilig hdl
Terrific
is this preemptive?
How priority is assigned to process whats is the macanisim actualy how priority is being assigned to process
could you please put auto-generated subtitles in the next videos ?
😊😊😊
Please many of the students need to learn these topics please make videos on topics on verilog hdl , structural and data flow modeling ,Design of combinational circuits structural and data flow modeling,Multiplexer, Application of Multiplexer, Verilog HDL Behavioural Modeling,
Verilog HDL Testbench
studying is cringe ,pussy
Tom xam 🙃
Did you finish the course
Waiting time was worng
我的小
Why are you indians always tediously showing every single step, even when its just adding numbers or decreasing 127 by 1? Not meant to be taken offensively but I noticed that in many videos and I think its really frustrating to watch sometimes, if you dont have a learning disability or something
skrt L. I have the same feeling but I understand why. Just like u find this video because ur professor skipped lots of steps of explanations that confused u, this gentlemen has to explain in details to ensure people with different levels of knowledge can all understand and get good grades in class.
it's a youtube video. you can always fast forward or skip it. not sure why you are whining about this.
Thank you