Lecture 3 - Process Scheduling in Operating System for CUET MCA | CUET 2024 скачать в хорошем качестве

Lecture 3 - Process Scheduling in Operating System for CUET MCA | CUET 2024

Lecture 3 - Process Scheduling in Operating System for CUET MCA | CUET 2024 ✦ Understanding Process Scheduling in Operating System 00:05 Importance of learning Process Scheduling and its practical applications in the operating system The significance of understanding the underlying concepts and algorithms for effective learning and problem-solving ✦ Process scheduling involves organizing and optimizing task execution in an operating system. 02:43 Scheduling determines the order and timing of tasks, similar to creating a daily timetable for activities. Tasks are assigned specific start and end times, just like a daily routine, ensuring efficient time management. ✦ Operating systems schedule processes using different algorithms 06:54 The system discriminates between processes to decide which to run first and later Understanding process scheduling helps in comparing different scheduling algorithms ✦ Process scheduling determines which processes are brought to the CPU at which time. 09:08 Long Term Scheduler decides which processes to bring to the CPU and uses a scheduling algorithm for this. Short Term Scheduler determines the order in which processes are executed on the CPU and also utilizes a scheduling algorithm. ✦ Processes can have varying sizes and execution times 13:47 This variation in process sizes and execution times means some processes will complete quickly, while others will take more time. Processes may arrive in the computer memory at different times, depending on when they need to be run. ✦ Understanding process IDs and arrival time for process scheduling 15:57 Process IDs help in unique identification and differentiation of each process Arrival time of each process is essential for scheduling algorithms to determine which processes are ready to be executed ✦ Operating system applies different algorithms based on the scenario. 19:58 It may use FCFS, shortest remaining job first, priority scheduling, round robin, multilevel feedback, or multilevel queue algorithms. The choice of algorithm depends on the scenario to be solved and requires comparing their advantages and disadvantages using parameters like waiting time. ✦ Process scheduling involves deciding whose waiting time is better to keep longer. 22:10 The process scheduling algorithm helps in comparing the waiting time of different processes and determines which one has more or less waiting time. Turnaround time is also a parameter for comparison between algorithms, indicating how much time it took to do the overall work for different processes. ✦ FCFS is the simplest process scheduling algorithm. 26:14 FCFS stands for First Come First Serve, where the first process that arrives is allocated the CPU first. This algorithm focuses only on the arrival time of processes, making it the simplest of all scheduling algorithms. ✦ Process scheduling focuses on prioritizing processes based on arrival time. 28:12 The Gantt chart is used to analyze and prioritize processes. FCFS scheduling prioritizes the process that arrives first. ✦ Understanding waiting time in process scheduling 32:22 The waiting time for a process is the time it spends waiting for the CPU after arrival before being allocated the CPU. The waiting time can be determined without using any complex formulas, by simply comparing the arrival time and the time when the CPU is allocated. ✦ Shortest Job First (SJF) prioritizes smaller jobs over larger ones. 34:23 SJF is a scheduling algorithm that prioritizes smaller jobs over larger ones, ensuring faster completion of tasks. The algorithm determines the order of execution based on the duration of the jobs, with shorter jobs given priority over longer ones. ✦ Priority Scheduling Algorithm assigns CPU to higher priority processes first 39:14 The priority of each process is determined and time is allocated accordingly The algorithm involves creating a Gantt chart to visualize process execution order ✦ Process scheduling based on priority in operating system 41:06 Explanation of how scheduling based on priority works Details about the allocation of processes based on their priority and execution time ✦ Processes in operating systems have different turnaround times based on their scheduling and execution. 44:52 The concept of turnaround time is the duration a process spends in the CPU from its arrival to its completion. Scheduling algorithms such as multi-level and multi-level feedback are used to manage and prioritize different processes based on certain criteria. ✦ Process scheduling involves grouping processes and applying different algorithms based on the group 47:07 Different groups of processes are made and algorithms are applied based on the group, such as first come first serve, shortest job first, or round robin. In multi-level scheduling, the operating system makes predictions on which algorithm to apply, but it can be inaccurate and cannot be reversed. ------- App Link :- Contact no - 9555031137