First-come-first-serve

Process E F G H I J K
Arrival Time 0 2 3 5 11 17 24
Bust Time(Ts) 4 9 3 7 5 6 12

E F G H I J K
0 4 13 16 23 28 34 46
Average turnaround Time: 102/7 =14.57
Average waiting Time: 56/7 = 8
Average Tr/Ts: 17.18/7 = 2.45
A. Shortest Remaining Time(SRTF)
Process E F G H I J K
Arrival Time 0 2 3 5 11 17 24
Bust Time(Ts) 4 9 3 7 5 6 12

Finish Time 4 34 14 19 25 7 46
Turnaround Time(Tr) 4 32 9 8 8 4 22
Waiting Time 0 23 2 3 2 1 10
Tr/Ts 1.00 3.56 3.0 1.14 1.60 0.67 1.83

E F G H I J K
0 4 7 14 19 25 34 46
Average turnaround Time: 87/7 = 12.43
Average waiting Time: 41/7 = 5.86
Average Tr/Ts: 12.8/7 = 1.83

B. Round Robin Quantum = 3

Process E F G H I J K
Arrival Time 0 2 3 5 11 17 24
Bust Time (Ts) 4 9 3 7 5 6 12

Finish Time 10 25 9 31 30 37 46
Turnaround Time (Tr) 10 23 6 26 19 20 22
Waiting Time 6 14 3 19 14 14 10
Tr/Ts 2.50 2.56 2.0 3.71 3.80 3.33 1.83

E F G H I J K
0 9 10 25 30 31 37 46
Average turnaround Time: 126/7 = 18
Average waiting Time: 80/7 = 11.43
Average Tr/Ts: 19.73/7 = 2.82
Shortest Remaining Time First

Process E F G H I J K
Arrival Time 0 2 3 5 11 17 24
Bust Time (Ts) 4 9 3 7 5 6 12

Finish Time 4 34 14 19 25 7 46
Turnaround Time (Tr) 4 32 9 8 8 4 22
Waiting Time 0 29 2 9 2 1 10
Tr/Ts 1.00 3.56 3.00 1.14 1.00 0.69 1.83

E F G H I J K
0 4 7 14 19 25 34 46
Average turnaround Time: 87/7 = 12.43
Average waiting Time: 41/7 = 5.86
Average Tr/Ts: 12.8/7 = 1.83
Round Robin: Quantum = 3
Process E F G H I J K
Arrival Time 0 2 3 5 11 17 24
Bust Time (Ts) 4 9 3 7 5 6 12

Finish Time 10 25 9 31 30 37 46
Turnaround Time (Tr) 10 23 6 26 19 20 22
Waiting Time 6 14 3 19 14 14 10
Tr/Ts 2.50 2.56 2.00 3.71 3.80 3.33 1.83

E F G E H F I H F J I H K J K K K
0 3 6 9 10 13 16 19 22 25 28 30 31 34 37 40 43
46

2.Then, answer the following items (5 items x 5 points):

a. Among the three (3) process scheduling algorithms that you have performed, which do you think
is the most efficient and why?
Answer: The Round Robin algorithm, in my opinion, is the most effective method for scheduling
processes. This is due to the fact that it is the most consistent and fair of the three algorithms.
To make sure that every process is given the same amount of time to run, it allocates a
predetermined amount of time for each one before moving on to the next. This enables the
execution of numerous processes at once while preventing one process from using up all the
resources. System administrators frequently choose it since it is also quite easy to implement.

b. Cite significant differences in the results of applying the First-Come First-Serve algorithm and
Round Robin algorithm. Elaborate on your answer.
The First-Come First-Serve (FCFS) scheduling method handles tasks in the order they are
received and is not preemptive. An approach for preemptive scheduling that cycles over jobs
is called Round Robin (RR). The time it takes for each job to finish is the biggest distinction
between the two algorithms. Because the FCFS algorithm handles jobs in the order they come,
earlier jobs will take longer to process. As a result of having to wait for previous jobs to finish,
this might cause tasks to take longer than required to complete. The RR algorithm, on the
other hand, gives each work a certain amount of time to process before moving on to the next
job. This guarantees that each task receives equal access to the processing resources, and
processing times are significantly reduced compared to the FCFS method. The fact that the RR
method accounts for processing time while the FCFS approach does not is another significant
distinction between the two algorithms. Jobs that will take longer to process can be scheduled
to execute in the same timeslot as a shorter job using the RR algorithm.

c. What could possibly happen if the value of the Quantum in Round Robin is increased to 5?
Elaborate on your answer.
Answer: Several things may occur if the Quantum in Round Robin is raised to 5. First of all, it
can cause the system's reaction time to lengthen. This is because the system will give each job
extra time before moving on to the next. Tasks will be able to finish more quickly, which can
result in overall greater performance. On the other side, it can also result in a longer total
context change time for the system. The scheduler will have to switch between tasks more
often when the Quantum is raised, which will result in an increase in context switching time. If
the Quantum in Round Robin is raised to 5, several things could happen. First of all, it could
lengthen the system's reaction time. This is because each task will receive more time before
the system moves on to the next. Tasks will be completed more quickly, which might lead to
better performance all around. On the other hand, the system may have a longer overall
context change time as a result. When the Quantum is raised, the scheduler will have to
switch between jobs more often, increasing the time required for context switching.

d. In your opinion, why does the average turnaround time and waiting time vary per algorithm?
Answer: Because different algorithms have varying degrees of complexity and need varying
amounts of time and resources to solve a given issue, the average turnaround time and waiting
time vary per algorithm. Different algorithms could need a different number of operations or
steps to do a task, or they might handle data in a different way. The quantity of data that has to
be processed and the size of the data sets can also influence how long it takes to do a task.

e. Would you suggest the utilization of the Round Robin algorithm for process scheduling in a file
management system? Why or why not
Answer: No, a file management system should not use the Round Robin method. This algorithm
is mostly employed for process scheduling, a method the operating system employs to control
the simultaneous execution of numerous processes. The storage and manipulation of files are
normally managed by file management systems, which do not include the same kind of process
scheduling.