Time Table Gantt Chart Process ID Time Process ID 0 1 2 3 4 5 6 Process ID 1 2 3 4 5 6 # Average turn around time = Average waiting time = Arrival Time 7 0 5 1 9 3 Exit Time # Burst Time 9 10 7 5 8 21 Turn Around Time # # Waiting Time # #
How would I fill out the Gant Chart using the First Come First Serve (FCFS)
FCFS: FCFS stands for First Come, First Serve. It is a scheduling algorithm in computer science and operating systems that assigns resources to processes based on their arrival time. In this algorithm, the process that requests the resources first is given the first chance to use them. The next process in line is given the chance to use the resources only after the previous process has completed. This continues until all the processes have completed. FCFS is a simple and straightforward algorithm that is easy to understand and implement, but it can result in long waiting times for some processes if there is a process that requires a lot of resources.
Step by step
Solved in 2 steps with 1 images
