Scheduling Algorithms Round robin for 4 processes
Example for 4 processes with time quantum = 4
Step 1: Create the scheduling table
Step 2: Calculate (count) turn around time and waiting time of each process
Step 3: Compare TT and WT with the FCFS algorithm
With Round robin algorithm, each process in ready list run the same amount of time (time quantum). After that the process release the CPU for the next one in RL. The burst time (firstly look at number at CPU column) left = the burst time total - time quantum, each time the process run the time left is decreased gradually until it = 0. If the time left of process is greater than 0, it comes back to the READY LIST right after the moment it releases the CPU.
For IO, we have R1 and R2, they run by FIFO algorithm.
CPU run, I/O wait, CPU finishes then I/O run. Processes alternate between these two states.
#schedulingalgorithms #OS #operatingsystem #waitingtime #turnaroundtime
Turn on subtitles by clicking cc
For more information about other scheduling algorithms, you can watch the OS playlist:
• Operating System tutorial (basic)
Drone in D của Kevin MacLeod được cấp phép theo giấy phép Ghi công Creative Commons 4.0. https://creativecommons.org/licenses/...
Nguồn: http://incompetech.com/music/royalty-...
Nghệ sĩ: http://incompetech.com/