Scribd
Upload
235 views4 pages

OS 06 Task Performance 1 - ARG

The document discusses three process scheduling algorithms: First-Come First-Serve, Shortest Remaining Time First, and Round Robin. It provides details on applying each algorithm including tables, Gantt charts, and performance metrics. It then asks questions about the most efficient algorithm, differences in results between FCFS and Round Robin, impact of increasing the quantum value in Round Robin, reasons for variation in average turnaround and waiting times between algorithms, and applicability of Round Robin for process scheduling in a file management system.

Uploaded by

Hannaninah Mae
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
235 views4 pages

OS 06 Task Performance 1 - ARG

The document discusses three process scheduling algorithms: First-Come First-Serve, Shortest Remaining Time First, and Round Robin. It provides details on applying each algorithm including tables, Gantt charts, and performance metrics. It then asks questions about the most efficient algorithm, differences in results between FCFS and Round Robin, impact of increasing the quantum value in Round Robin, reasons for variation in average turnaround and waiting times between algorithms, and applicability of Round Robin for process scheduling in a file management system.

Uploaded by

Hannaninah Mae
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Operating Systems

06 Task Performance 1 – ARG

Instructions:

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

· First-Come First-Serve
A. Complete and detailed table
PROCESS E F G H I J K
Arrival 0 2 3 5 11 17 24
Time
Bust 4 9 3 7 5 6 12
Time
Finish 4 13 16 23 28 34 46
Time
Turnarou 4 11 13 18 17 17 22
nd Time
Waiting 0 2 10 11 12 11 10
Time
Tr/Ts 1.00 1.22 4.33 2.57 3.4 2.83 1.83

B. A detailed Gantt Chart

E F G H I J K
0 4 13 16 23 28 34 46

C. The average turnaround time (3 points)


102/7 = 14.57
D. The average waiting time (2 points)
56/7 = 8

· Shortest Remaining Time First


A. Complete and detailed table
PROCESS E F G H I J K
Arrival 0 2 3 5 11 17 24
Time
Bust 4 9 3 7 5 6 12
Time
Finish 4 34 17 14 19 25 46
Time
Turnarou 4 32 4 9 8 8 22
nd Time
Waiting 0 23 1 2 3 2 10
Time
Tr/Ts 1.00 3.56 1.33 1.29 1.60 1.33 1.83

B. A detailed Gantt Chart

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

C. The average turnaround time (3 points)


87/7 = 12.43
D. The average waiting time (2 points)
41/7 = 5.86

· Round Robin: Quantum = 3


A. Complete and detailed table
PROCESS E F G H I J K
Arrival 0 2 3 5 11 17 24
Time
Bust 4 9 3 7 5 6 12
Time
Finish 10 25 9 31 30 37 46
Time
Turnarou 10 23 6 26 19 20 22
nd Time
Waiting 6 14 3 19 14 14 10
Time

B. A detailed Gantt Chart


E F G E H F I
0 3 6 9 10 13 16 19

H F J I H K J
19 22 25 28 30 31 34 34

J K K K
34 37 40 43 46

C. The average turnaround time (3 points)


126/7 = 18
D. The average waiting time (2 points)
80/7 = 11.43

3. 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?
Among the process scheduling algorithm, I think the most efficient is the Round Robin because this
algorithm is used in the time-sharing environments where each process is limited by a time slice and there will
be no starvation in case of the round-robin because every process will get chance for its execution.

b. Cite significant differences in the results of applying the First-Come First-Serve algorithm and Round
Robin algorithm. Elaborate on your answer.

 First -Come First-Serve


Low Average Waiting Time and Turnaround Time. Simple and Easy to implement type of algorithm
The processes are to be executed on the First Come basis. Non-Preemptive and Not Efficient.

 Round Robin
High Average Turnaround Time and Waiting Time. Must perform a lot of contexts switching here, which will
keep the CPU idle. Use time slicing to execute every process. Preemptive and Efficient.
c. What could happen if the value of the Quantum in Round Robin is increased to 5? Elaborate on your
answer.
If the quantum value in the Round Robin scheduling method increases to 5, the time every procedure
can continue running continuously before getting preempted is extended. Because processes will require
longer time slices to run, this change could result in less context-switching overhead. However, it may result in
longer wait times for processes that require shorter execution durations, thus compromising the system's
overall responsiveness. The quantum size in Round Robin is chosen to strike a balance between decreasing
context-switching overhead and ensuring adequate reaction times for interactive operations.

d. In your opinion, why does the average turnaround time and waiting time vary per algorithm?

Because each scheduling algorithm has its own set of rules and priorities, average response time and
waiting time differ. First Come First Serve (FCFS) algorithms favor the order of arrival, which may result in
greater wait times for processes with shorter burst times. Shortest Job Next (SJN) and Shortest Job First (SJF)
algorithms prioritize the performance of the shortest jobs first, with the goal of minimizing wait times. Round
Robin assures fairness with its predetermined time slices, but it may result in longer turnaround times for
some types of workloads. The variety stems from how every algorithm generates judgments based on varied
factors, which influences the system's general effectiveness and reactivity.

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

The Round Robin algorithm's usefulness for scheduling processes in a file management system is
determined by the system's specific requirements and characteristics. Round Robin is well-known for its
simplicity and fairness, making it an excellent choice for systems in which all processes should have an equal
portion of the CPU. Other scheduling techniques, such as Shortest Job Next (SJN) or Priority Scheduling, may
be more appropriate if the system comprises processes with radically varied execution periods or if timeliness
is a vital factor. Round Robin may result in inferior performance in circumstances with widely varying
execution periods, because the set time slices may not correspond well with the variable processing needs of
distinct activities in a file management system.

You might also like