Scribd
Upload
8 views2 pages

06 Task Performance Plattech - Mansueto

The document compares three process scheduling algorithms: First-Come-First-Served (FCFS), Shortest Remaining Time First (SRTF), and Round Robin (RR). It concludes that FCFS is the most efficient due to its straightforward approach, while highlighting the differences in preemptiveness between FCFS and RR. The document also discusses the impact of quantum time on RR and the variability of average turnaround and waiting times across different algorithms.

Uploaded by

Coco Puma
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
8 views2 pages

06 Task Performance Plattech - Mansueto

The document compares three process scheduling algorithms: First-Come-First-Served (FCFS), Shortest Remaining Time First (SRTF), and Round Robin (RR). It concludes that FCFS is the most efficient due to its straightforward approach, while highlighting the differences in preemptiveness between FCFS and RR. The document also discusses the impact of quantum time on RR and the variability of average turnaround and waiting times across different algorithms.

Uploaded by

Coco Puma
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/ 2

First – Come First – Serve

A B C D E F G
0 4 13 16 23 28 34 46
Job Arrival Time Burst Time Finish Time Turnaround time Waiting Time
A 0 4 4 4 0
B 2 9 13 11 2
C 3 3 16 13 10
D 5 7 23 18 11
E 11 5 28 17 12
F 17 6 34 17 11
G 24 12 46 22 10
AVERAGE 102/7 = 14.571 56/7 = 8

Shortest Remaining Time First

A C D E F B G
0 4 7 14 19 25 34 46
Job Arrival Time Burst Time Finish Time Turnaround time Waiting Time
A 0 4 4 4 0
B 2 9 34 32 23
C 3 3 7 4 1
D 5 7 14 9 2
E 11 5 19 8 3
F 17 6 25 8 2
G 24 12 46 22 10
AVERAGE 87/7 = 12.429 41/7 = 5.857

Round Robin: Quantum = 3

A B C A D B E D B F E D G F G G G
0 3 6 9 10 13 16 19 22 25 28 30 31 34 37 40 43 46
Job Arrival Time Burst Time Finish Time Turnaround time Waiting Time
A 0 4 10 10 6
B 2 9 25 23 14
C 3 3 9 6 3
D 5 7 31 26 19
E 11 5 30 19 14
F 17 6 37 20 14
G 24 12 46 22 10
AVERAGE 126/7 = 18 80/7 = 11.429

Answer the following items:

a. Among the three (3) process scheduling algorithms that you have performed, which do you think is the most efficient
and why?
- Of the three processes I used, I believe the First-Come-First-Served scheduling algorithm is the most effective because it
actually writes down what comes first before moving on to the next process.
b. Cite significant differences in the results of applying the First - Come First-Serve algorithm and Round Robin algorithm.
Elaborate on your answer.
- Round Robin (RR) is a preemptive scheduling technique, whereas First Come First Served (FCFS) is a non-preemptive
scheduling algorithm.
c. What could possibly happen if the value of the Quantum in Round Robin is increased to 5? Elaborate on your answer.
- The Gantt Chart, as well as the Finish time, Turnaround time, and Waiting time, will alter if the Round Robin is extended to
5.
d. In your opinion, why does the average turnaround time and waiting time vary per algorithm?
- For the same set of tasks, various CPU scheduling techniques result in varying turnaround times.
This is because processes' waiting times differ depending on how the CPU schedules them.
e. Would you suggest the utilization of the Round Robin algorithm for process scheduling in a file management system? Why
or why not?
- No, what we are utilizing right now is sufficient, so there is no need to change.
-

You might also like