IT2106

MARCELO, LIOR ANGELINE P.

BSCPE – 211

Task Performance
Process Scheduling
Instructions:

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

1. Apply the following scheduling algorithms to the list of processes above.

• First-Come First-Serve
• Shortest Remaining Time First
• Round Robin: Quantum = 3

FIRST COME, FIRST SERVE

Finish Tme 4 13 16 23 28 34 46
Turnaround 4 11 13 18 17 17 22
Time
Waiting Time 0 2 10 11 12 11 10

GANTT CHART
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.0

SHORTEST REMAINING TIME FIRST

Finish Tme 4 34 14 19 25 7 46
Turnaround 4 32 9 8 8 4 22
Time
Waiting Time 0 23 2 3 2 1 10
 IT2106

GANTT CHART
E G H I J F K
0 4 7 14 19 25 34 46

AVERAGE TURNAROUND TIME: 87/7 = 12.43

AVERAGE WAITING TIME: 56/7 = 5.86

FIRST COME, FIRST SERVE

Finish Tme 10 25 9 31 30 34 46
Turnaround 10 23 6 26 19 20 22
Time
Waiting Time 6 14 3 19 14 14 10

GANTT CHART
G E F I H J K
0 9 10 25 30 31 37 46

AVERAGE TURNAROUND TIME: 126/7 = 18

AVERAGE WAITING TIME: 80/7 = 11.43

a. Among the three (3) process scheduling algorithms that you have performed, which do you think
is the most efficient and why?
Shortest Remaining Time First (SRTF) excels in operating systems by prioritizing tasks with the
smallest remaining execution time, reducing waiting times for shorter processes and enhancing overall
system responsiveness. Its efficiency lies in swiftly completing shorter tasks, optimizing resource usage,
and improving throughput by accommodating more processes within a given timeframe. However,
SRTF's emphasis on shorter tasks might lead to potential delays for longer processes, a trade-off that
needs consideration in scenarios where longer tasks are critical.

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 Served (FCFS) technique is all about handling jobs in the order they show
up, no interruptions, straight to the CPU. But, take a peek at Round Robin (RR) scheduling—it's a
different story. Here, tasks get sliced into smaller time bits, allowing different jobs to take turns. In RR,
each task gets a fixed slice of CPU time, and when that time's up, it's onto the next task waiting in line.
 IT2106

c. What could possibly happen if the value of the Quantum in Round Robin is increased to 5?
Elaborate on your answer.
- When you tweak the quantum size, it's like fine-tuning a balance. Making it larger might cause
a bit of unfairness among connections temporarily, affecting both Average Turnaround Time and Average
Waiting Time. On the other hand, going smaller boosts fairness but also cranks up the computational
needs for the link scheduler. This means more rounds of computation before a packet gets its turn to be
sent out.

d. In your opinion, why does the average turnaround time and waiting time vary per algorithm?
-Each scheduling algorithm comes with its own set of objectives and performance measures. Its
efficiency and the resulting average turnaround and waiting times depend on how well it aligns with
these criteria.

e. Would you suggest the utilization of the Round Robin algorithm for process scheduling in a file
management system? Why or why not?

Yes, This method is favored for its simplicity, ease of implementation, and its ability to prevent
CPU starvation by ensuring each process receives an equal share of CPU time. Due to these advantages,
it stands as one of the most commonly used CPU scheduling techniques at the heart of many systems.