Scheduling Algorithms SJF (shortest job first) for 4 processes
Example for 4 processes
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 Round Robin and FCFS algorithms
Each time a new process come to RL we have to compare the burst time left of the current process with the new one to decide which one will use CPU. If the CPU burst time left of the current process is smaller than the CPU burst time of new process so it's ok, continue run the current process. Else, the current running process goes back to the READY LIST.
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/