Task PerformanceProcess SchedulingObjectives: At the end of the exercise, the students should be able to: Analyze the different types of process scheduling for an operating system; andTest the efficiency of some scheduling algorithms by comparing the turnaround time and/or wait time of the Instructions: ProcessEFGHIJKArrival Time0235111724Bust Time49375612 Apply the following scheduling algorithms to the list of processes· First-Come First-ServeShortest Remaining Time FirstRound Robin: Quantum = 3For each process scheduling algorithm, provide the following:A complete and detailed table that contains the following criteria for each processFinish timeTurnaround timeWaiting time A detailed Gantt Chart The average turnaround time The average waiting timeThen, answer the following itemsAmong the three (3) process scheduling algorithms that you have performed, which do you think is the most efficient and why?Cite significant differences in the results of applying the First-Come First-Serve algorithm and Round Robin algorithm. Elaborate on yourWhat could possibly happen if the value of the Quantum in Round Robin is increased to 5? Elaborate on yourIn your opinion, why does the average turnaround time and waiting time vary per algorithm?Would you suggest the utilization of the Round Robin algorithm for process scheduling in a file management system? Why or why not?

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

Objectives:

At the end of the exercise, the students should be able to:

Analyze the different types of process scheduling for an operating system; and
Test the efficiency of some scheduling algorithms by comparing the turnaround time and/or wait time of the

For each process scheduling algorithm, provide the following:
A complete and detailed table that contains the following criteria for each process
- Finish time
- Turnaround time
- Waiting time
A detailed Gantt Chart
The average turnaround time
The average waiting time
Then, answer the following items
Among the three (3) process scheduling algorithms that you have performed, which do you think is the most efficient and why?
Cite significant differences in the results of applying the First-Come First-Serve algorithm and Round Robin algorithm. Elaborate on your
What could possibly happen if the value of the Quantum in Round Robin is increased to 5? Elaborate on your
In your opinion, why does the average turnaround time and waiting time vary per algorithm?
Would you suggest the utilization of the Round Robin algorithm for process scheduling in a file management system? Why or why not?