EASY-HOW-TO CPU Scheduling Algorithm (FCFS, SJF, Non-Preemptive Priority, and RR) Eval (Manual)
Вставка
- Опубліковано 11 бер 2021
- In this video tutorial, you will learn how to:
1. Draw Gantt charts illustrating the execution of the processes using First-Come-First-Serve (FCFS), Shortest-Job-First (SJF), Non-Preemptive Priority, and Round Robin Scheduling
2. Derive the turnaround time of each process for each of FCFS, SJF, Non-Preemptive Priority, and RR scheduling algorithms based on their corresponding Gantt charts.
3. Derive the waiting time of each process for each of FCFS, SJF, Non-Preemptive Priority, and RR scheduling algorithms based on their corresponding Gantt charts.
4. Compute the average waiting time for FCFS, SJF, Non-Preemptive Priority, and RR scheduling algorithms.
5. Determine the most optimal CPU scheduling algorithm for a given set of processes.
![[OPERATING SYSTEMS] 5 - CPU Scheduling](http://i.ytimg.com/vi/RiO6Mdwh7JU/mqdefault.jpg)
![[OPERATING SYSTEMS] 5 - CPU Scheduling](/img/tr.png)
Your explanation is better than my professor, which gives many loops that confuses us. Thank you for this!
You're very welcome! 🥰 I am really glad to hear that it helped you understand the CPU Scheduling Algorithms. Maybe your professor used hard-to-understand words as to why he/she confused you. 😅 God Bless!
Can you explain how you use round Robin for npp. Isn’t that impossible since once a process is going, it can’t be stopped?
Thank you so much mam !! It is really helpful ! I mean that sincerely !!!
I am always very grateful that people like you, are willing to spend lots of time and patiently to teach and share knowledge to us. BIG RESPECT ! 🙏
The world is a much better place because of you.
I wish you will have a very good life!
Again, thank you so much !
Wow, thank you for the compliment. I am an educator by profession so I think it is natural for us to spent our time teaching. I made this channel primarily for my students at the university where I am employed. I am very overjoyed that you appreciate this content. God bless you! 😇
Thank you so much for your video. Easy explanation for beginner like me, apreciate it a lot!
You're very much welcome! 😊 I'm happy you understood my explanation about CPU Scheduling Algorithms.
Amazing video, congratulations.
Thank you very much! 😊
Thank you for this explanatory video maam. Nice Explanation of the numerical.
Very helpful video, thanks for the lesson
You're very welcome! 🥰 I am really glad to hear that it helped you understand the CPU Scheduling Algorithms. God Bless!
well it's really helpful, keep on uploading more staff
Thank you very much! 🥰 I am really glad to hear that it helped you understand the CPU Scheduling Algorithms. God Bless!
Thanks for this easiest explanation I could ever get. :)
You're very welcome! 🥰 I hope that you learned something from this tutorial. God Bless!
well explained, thank you very much!!!!!
You're very welcome! 🥰 I hope that you learned something from this lecture. God Bless!
Thank you so much ma'am... It was really useful for me ✨😇
You're very much welcome! 🥰 I hope that you can learn something from my content. God Bless!
your "OK" voice sound are very sweet..☺️
Thank you for the compliment 😊
Thank you so much mam 🙏 I'm confused with this question and did not find its same related question and video anywhere but only 1 video in UA-cam mam is your and now I'm solved my question with the help of your video Thank you so so much mam for this
Please further do like this will help lot of us students
You're very welcome! 🥰 I am really glad to hear that it helped you understand the CPU Scheduling Algorithms. I really made this UA-cam channel for my students primarily to learn about computer concepts virtually. I made sure to simplify the explanation as to not alienate them. Hope you find my other videos helpful. Thank you.
what a nice explanation. LOVEEEEEEEEEEEEEEEEEEEEEEE
Thank you for your kind words. 🥰
Thank you 🙏
You're very much welcome! 🥰 I hope that you can learn something from my content. God Bless!
So on the NPP for those with a tied priority would it be wrong if I Let P1 execute to completion instead of involving RR since it's queued higher than P3? As RR makes the algorithm Preemptive.
Thank you soo much ❤️
You're very much welcome! 🥰 I hope that you can learn something from my content. God Bless!
Thank You My sisters
You're welcome! For the sake of those who want to learn CPU Scheduling Algorithm 😊
Your the greatest sweetheart. thank you
You're welcome. I am glad that my content is useful for your learning 😊
13:09 RIP ant🐜😭
Thanks for your beautiful Video!
Okay!!! Haha!( nice pronunciation actually)
Thank you so much Miss. Okhayyy.....(haha)
non preemptive was bit confusing.....
You're welcome! But have you already understood the Non-Preemptive Priority Scheduling?
@@BlancaflorArada ya , i did watch again and understood that 😁
@@johnybonny8262 Well, good for you Mr. Johny Bonny 😊
how do i compute the average turnaround time
❤
Whats the average response time
Hello Good day!
According to the Operating Systems Concepts (2018), response time is the amount of time it takes the system to respond to user action. It also can be defined as time at which the process gets the CPU for the FIRST TIME - Time of arrival of the process in main memory (that is ready queue) (from Stack Overflow).
From these definitions, we can conclude that the response time is the first waiting time of the process before it will be executed by the CPU. Specifically in the RR Scheduling Gantt chart, we can already derive that the response time of each processes: P1 = 0, P2 = 1, P3 = 2, P4 = 3, and P5 = 4. To get the average response time for RR Scheduling: (0 + 1 + 2 + 3 + 4)/5 = 10 milliseconds. By this example, we can already solve the corresponding average response time of other CPU Scheduling algorithms. Hope this helps 😊
Hi po mam pa ano po kong Gantt chart yong basihan to compute the average waiting time using the following CPU Scheduling Algorithm po 🤧😥😥
Sorry for the late reply. Hindi ko alam kung tama ang intindi ko sa tanong mo, pero sadya namang sa Gantt chart mo lang madederive ang waiting time at para makuha mo yung average waiting time, i-add mo lang ang lahat ng waiting time ng lahat ng processes, then divided by the number of the processes. Saka have you watched the whole video? Diniscuss ko naman 😊
How she be drawing straight lines to connect those points with a free hand with such ease😅
Thank you for the compliment. 🥰 Actually, I know how to draw, that may be the reason why it is like that. 😊
@@BlancaflorAradaOh yeah explains why. You're welcome.😊 Thank so much for this great lesson found the same question in my exam paper.🙌🏿
Wow, lucky you. Hope you got perfect points for that question.