Scheduling Algorithms FCFS 4 processes
Explanation:
Today we going to look at algorithm FCFS. Here is the example, i will step by step put it into the table above. CPU run first when process released the CPU, then IO (R1,R2) start. Only when IO finish running, the process come back to the Ready List, wait the CPU to run the next round, then CPU run next round finish and IO run.....
After filling the table, we can count (calculate) the waiting time and the Turn around time of each process
#schedulingAlgorithms #OS #operatingsystem #waitingtime #turnaroundtime
Sub:
Turn on subtitles by clicking cc
Today we going to look at algorithm FCFS
Here is the example, i will step by step put it into the table
00:55 At the moment 0, process P1 comes to the Ready list, CPU is free so P1 run
01:55 Moment 2, P2 comes to Ready List but P1 is using CPU so P2 wait in Ready List
02:58 MISTAKE*** i think P3 come to ready list at moment 6, CPU burst time P3 = 10 - i will notice it later
05:36 After CPU of process X finished, I/O will run
I/O run by FIFO algorithm
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/