Video summary: - A CPU scheduler is a part of the operating system that determines which process to allocate the CPU to at any given time. - A dispatcher is a component of the operating system that is responsible for actually switching the CPU from one process to another according to the decision made by the CPU scheduler. - Dispatch latency refers to the time taken by the dispatcher to stop one process and start executing another process. - CPU scheduling may take place when a process: switches from running to waiting state switches from running to ready state switches from waiting to ready state terminates - Preemptive scheduling is a CPU scheduling technique where the operating system interrupts the currently executing process to allocate the CPU to a higher-priority process. - Non-preemptive scheduling is a CPU scheduling technique where the currently running process is not interrupted and continues to execute until it voluntarily releases the CPU, blocks, or completes its execution, and only then the operating system selects another process to execute.
Very well explained! CPU Scheduler selects the particular program that is to be assigned to the CPU for execution while Dispatcher is a program that assigns the hold of the CPU to the program selected by the scheduler and the time taken by the dispatcher to assign hold of the CPU to the program selected by scheduler is called latency. As switching is frequent task so the the latency of dispatcher should be minimal. Two ways of scheduling are non-preemptive or cooperative and preemptive. In non-preemptive a process that is in execution by the CPU is never disturbed. So it happens when the process is terminated or has switched to waiting state. Whereas in preemptive, the processor can be assigned to another process even when the already existing process was being executed. It happens when another process of very high priority needs to executed first.
1) Scheduler: Selects a process in the ready queue to be given the CPU 2) Dispatcher: Gives the control of the CPU to the process selected by the scheduler. The time between the stopping and starting a process execution is called dispatch latency. 3) Preemptive: When a process change from running state to ready state (interrupt) or from waiting to ready state (I/O) 4) Nonpreemptive or cooperative scheduling: When a process change from running to waiting state (I/O) or terminates. A new process in the ready queue (if it is not empty) have to selected to be given the CPU.
Very helpful and greate Playlist.. Learning direct from your videos.. You may be got happy after knowing that One of the Ma'am from our College suggested your channel for learning.. Thank you.. Thank you very much for such a Great efforts..
For simplicity sake, We need to understand at what process's state does it finishes it's execution whether it is in waiting state and termination state. On another hand, when it is in ready state means the process is not done yet or it is halfway of it's execution or maybe halfway of it's termination state?. So, if the process is in "ready state" We can schedule the processes that need to use cpu based on their priority?. As for the non-pre emptive scheduling, Either we want to give the cpu to another processes or not, We have no choice because the process has finished it's execution Meaning no need to use CPU again. So just give it to another processes. As for the name "pre-emptive", I am suggesting it needs to empty the cpu first before giving it to other processes. Hopefully this is correct.
GC state runs in preemptive which means the CLR needs to turn those cooperative threads into preemptive threads for GC to run. said that, if the GC thread pertains to the same process , if the process is taken away from cpu ,how the GC tread will run if it needs to run in preemptive state ???? do you mean process thread when you said process? right? meaning that a process thread is suspended (interrupted/waited) while another GC thread on the main process is run.
he said that among the process in the ready queue, CPU scheduler is the one which selects the process who will get CPU. That means CPU scheduler is also one of the processes in the ready queue. Right?
I'm garbage. This is the exact same concept that is on book the book "Operating System Concepts" page 202 and I had no clue what i was reading until i watched this video.
in multitasking cpu switches process when higher priority comes and current one moved to ready state but in multiprograming cpu will not switch any other process untill it finishes or it will when the current process asksfor IO operation
Reviewing exam and find this channel. Totally game changer. Much better than professor reading slides in class
Yes, u are right Xin Li
Video summary:
- A CPU scheduler is a part of the operating system that determines which process to allocate the CPU to at any given time.
- A dispatcher is a component of the operating system that is responsible for actually switching the CPU from one process to another according to the decision made by the CPU scheduler.
- Dispatch latency refers to the time taken by the dispatcher to stop one process and start executing another process.
- CPU scheduling may take place when a process:
switches from running to waiting state
switches from running to ready state
switches from waiting to ready state
terminates
- Preemptive scheduling is a CPU scheduling technique where the operating system interrupts the currently executing process to allocate the CPU to a higher-priority process.
- Non-preemptive scheduling is a CPU scheduling technique where the currently running process is not interrupted and continues to execute until it voluntarily releases the CPU, blocks, or completes its execution, and only then the operating system selects another process to execute.
thanks man you are life saver for exam
thank you
Tomorrow is my exam 😂😂😂🎉🎉🎉🎉🎉 and this channel helps me a lot 😁 , love you neso ❤❤❤❤🎉🎉
Very well explained! CPU Scheduler selects the particular program that is to be assigned to the CPU for execution while Dispatcher is a program that assigns the hold of the CPU to the program selected by the scheduler and the time taken by the dispatcher to assign hold of the CPU to the program selected by scheduler is called latency. As switching is frequent task so the the latency of dispatcher should be minimal. Two ways of scheduling are non-preemptive or cooperative and preemptive. In non-preemptive a process that is in execution by the CPU is never disturbed. So it happens when the process is terminated or has switched to waiting state. Whereas in preemptive, the processor can be assigned to another process even when the already existing process was being executed. It happens when another process of very high priority needs to executed first.
✌️😳👏
This video is really helpful! I'm not a native English speaker but I fully understand all the concepts, thank you sir!
Please add more videos frequently into Operating system playlist,I have watched all 38 videos now ,they were great , waiting for the next video.Thanks
thankyou soo much, the way you explain is phenomenal. ❤❤❤
Very good teacher. I'm enjoying the lectures.
Succinct and clear explanation. Thank you very much, sir. Keep up the great work.
these lectures hit different an hour before exam
This did a lovely job of explaining the concepts, thanks x
So well explained, each and every point is explained perfectly
1) Scheduler: Selects a process in the ready queue to be given the CPU
2) Dispatcher: Gives the control of the CPU to the process selected by the scheduler. The time between the stopping and starting a process execution is called dispatch latency.
3) Preemptive: When a process change from running state to ready state (interrupt) or from waiting to ready state (I/O)
4) Nonpreemptive or cooperative scheduling: When a process change from running to waiting state (I/O) or terminates. A new process in the ready queue (if it is not empty) have to selected to be given the CPU.
I like your way of teaching. Also your English is very good too.
very clear and thorough explanation ! Thank you sir !
Very helpful and greate Playlist..
Learning direct from your videos..
You may be got happy after knowing that One of the Ma'am from our College suggested your channel for learning.. Thank you..
Thank you very much for such a Great efforts..
amazing explanation!!love from Ethiopia
Please create a playlist for Data structure and Algorithms ,it is the need of the hour......
For simplicity sake,
We need to understand at what process's state does it finishes it's execution whether it is in waiting state and termination state.
On another hand, when it is in ready state means the process is not done yet or it is halfway of it's execution or maybe halfway of it's termination state?.
So, if the process is in "ready state"
We can schedule the processes that need to use cpu based on their priority?.
As for the non-pre emptive scheduling,
Either we want to give the cpu
to another processes or not,
We have no choice because the process has finished it's execution
Meaning no need to use CPU again.
So just give it to another processes.
As for the name "pre-emptive", I am suggesting it needs to empty the cpu first before giving it to other processes. Hopefully this is correct.
please, upload more videos , you are amazing in explanation
This explains so much about why computers do weird shit
Sir please upload the videos about process sychorinzation 🙏
Please do make lec on coa topics like 1at and 2nd pass of assembler
beautifully explained!
Thank you very much. It is very understandable once again.
good explanation
GC state runs in preemptive which means the CLR needs to turn those cooperative threads into preemptive threads for GC to run. said that, if the GC thread pertains to the same process , if the process is taken away from cpu ,how the GC tread will run if it needs to run in preemptive state ???? do you mean process thread when you said process? right? meaning that a process thread is suspended (interrupted/waited) while another GC thread on the main process is run.
thanks for the video sir, where can we get the slides that you are using?
Thank you very much for this awesome explanation!
Thanks
great video, thank you
Preemptive and Non-Preemptive Scheduling
actually explained at:
13:36
Thank you😭❤️
Very helpful, thank you
Thank you so much for this video
Great lecture 👍
he said that among the process in the ready queue, CPU scheduler is the one which selects the process who will get CPU.
That means CPU scheduler is also one of the processes in the ready queue. Right?
Shukriya sir 🙏 😃😃😃
you're a life saver
wow, thank you so much
Amazing Explainetion : one night before exam 😜
Add .net programming videos please
exam after 3 hours watching in 2x but i want 4x speed...😥😆
Ohh me morning 9:30AM exam but now 2:26AM watching this video.😂😂😅
Use a chrome extension , I use speedup
why is waiting state to ready state preemptive ? It went to Waiting state for I/O only after running state , right?
Thank you sir
well explained!!
thanks so much
Sir please upload course of Data analysis with python
I'm garbage. This is the exact same concept that is on book the book "Operating System Concepts" page 202 and I had no clue what i was reading until i watched this video.
Thanks for taking galvin to videos 😁
Thank you sir👍🏾
My Savior
All the lectures are made from Galvin's book. Even some lines are exactly the same
Thanks you are the boss
Thankyou sir
This is a great Chanel
Thanks Sir...
who will decide priority for the scheduling sir
isn't CPU scheduler the Kernel of operating system??
can a operating system scheduling be both preemptive and non preemptive?
non-preemptive = preemptive + non preemptive (in practical)
Thankuu
sir ji notes mil jayenge kya website pr
08:30 why is ready state to running state not considered?
Becz at that time process is assigned to cpu not scheduled, schedule means we are swapping processes. I think it clear for u 😅
❤️
thats the comment
please provide these slides in a g drive sir. it would help in revision.
You are awesome
When she text you for netflix and chill but you decline replying you're binging OS mechanisms and design for your imaginary ASM/C OS on YT.
exam today at 7 pm and here i am watching this vid at 6:17 pm with x2 speed
Sir please make videos under 10 to 15 minutes not longer
yeah I still don't get it
can i have pdf notes???
I have a project tomorrow watching at 4x
Awesome
process switches from running state to ready state due to some interruptions.
Can someone give me practical example of such interrupts?
in multitasking cpu switches process when higher priority comes and current one moved to ready state but in multiprograming cpu will not switch any other process untill it finishes or it will when the current process asksfor IO operation
Either exam or not 2x is best
I was here on 17 April 2023
17 July 2024
17 sept 24
Comprehensive
This is how commerce guys can pass os exam.
❤❤❤❤❤❤❤❤
3
I think, the correct pronounciation is "cedular"... Not "skejular".
washout 2D
Thank you sir
Thanks sir