Scribd
Upload
2 views3 pages

Process Scheduling Task Performance

The document outlines the performance of various process scheduling algorithms: First-Come First-Serve (FCFS), Shortest Remaining Time First (SRTF), and Round Robin (RR), detailing their execution orders, Gantt charts, and completion tables. SRTF is identified as the most efficient algorithm with the lowest average turnaround and waiting times, while FCFS and RR have distinct advantages and disadvantages in terms of waiting times and fairness. Additionally, the document discusses the impact of quantum size in RR and the suitability of RR for file management systems.

Uploaded by

8mbh7jkn8j
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
2 views3 pages

Process Scheduling Task Performance

The document outlines the performance of various process scheduling algorithms: First-Come First-Serve (FCFS), Shortest Remaining Time First (SRTF), and Round Robin (RR), detailing their execution orders, Gantt charts, and completion tables. SRTF is identified as the most efficient algorithm with the lowest average turnaround and waiting times, while FCFS and RR have distinct advantages and disadvantages in terms of waiting times and fairness. Additionally, the document discusses the impact of quantum size in RR and the suitability of RR for file management systems.

Uploaded by

8mbh7jkn8j
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

Process Scheduling Task Performance

Process Table
Process Arrival Time Burst Time

E 0 4

F 2 9

G 3 3

H 5 7

I 11 5

J 17 6

K 24 12

1. First-Come First-Serve (FCFS)


Execution Order: E → F → G → H → I → J → K

Gantt Chart:

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

Completion Table:

Process Finish Time Turnaround Time Waiting Time (TAT -


(FT - AT) BT)

E 4 4 0

F 13 11 2

G 16 13 10

H 23 18 11

I 28 17 12

J 34 17 11

K 46 22 10

Averages:
Average Turnaround Time: 14.57

Average Waiting Time: 8.00

2. Shortest Remaining Time First (SRTF)


Execution Order: E → G → F → H → I → J → K

Gantt Chart:

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

Completion Table:

Process Finish Time Turnaround Time Waiting Time (TAT -


(FT - AT) BT)

E 4 4 0

F 16 14 5

G 7 4 1

H 23 18 11

I 28 17 12

J 34 17 11

K 46 22 10

Averages:

Average Turnaround Time: 13.71

Average Waiting Time: 7.14

3. Round Robin (Quantum = 3)


Execution Order: E → F → G → H → F → H → I → J → K → F → K

Gantt Chart:

|E |F |G |H |F |H |I |J |K |F |K |
0 3 6 9 12 15 18 21 24 27 33 46

Completion Table:

Process Finish Time Turnaround Time Waiting Time (TAT -


(FT - AT) BT)
E 3 3 0

F 27 25 16

G 6 3 0

H 18 13 6

I 24 13 8

J 33 16 10

K 46 22 10

Averages:

Average Turnaround Time: 13.57

Average Waiting Time: 7.14

4. Analytical Questions
a. **Most Efficient Algorithm:** SRTF is the most efficient, minimizing average turnaround
and waiting times.

b. **Differences Between FCFS and Round Robin:**


- FCFS processes tasks in arrival order, causing long waiting times for later processes.
- Round Robin improves fairness but increases context-switching overhead.

c. **Effect of Increasing Quantum in RR (to 5):**


Larger quantum reduces context switches but may delay shorter tasks.

d. **Why Times Vary Across Algorithms:**


Turnaround and waiting times vary because each algorithm prioritizes tasks differently.

e. **Suitability of RR for File Management Systems:**


Yes, RR ensures fairness and avoids starvation. Proper tuning of the quantum is essential.

You might also like