Defined interactive system goals? List various interactive scheduling algorithms. Consider following process data and compute average waiting time and average turnaround time for RR(quantum 10) and priority scheduling algorithms.

Question

Suresh Chand · Accepted Answer

In interactive system, processes are scheduled according to priority. Some of the interactive system goals are Response Time: Minimize the response time for the user Waiting Time: Minimize total time spent waiting in the queue Throughput: Maximize jobs per given time period Various interactive scheduling algorithms are: Round-Robin Scheduling Priority Scheduling Multiple Queue 1st Round Robin: Ready Queue: A C A B C B C B B Gantt Chart: | A | C | A | B | C | B | C | B | B | 0 10 20 26 36 46 56 61 71 78 P.ID Arrival Time Brust Time Competition Time Turn Around Waiting Time A 0 16 26 26 10 B 12 37 78 66 29 C 7 25 61 54 29 Average turn around time: (frac{26 + 66 + 54}{3}) = 48.66 Average waiting time = (frac{10 + 29 + 29}{3}) = 22.66 2nd Priority Schedule: Gantt Chart: | A | A | A | B | C | 0 7 12 16 53 78 P.ID Arrival Time Brust Time Competition Time Turn Around CUT A 0 16 16 16 0 B 12 37 53 41 4 C 7 25 78 71 46 Average turn around time: (frac{16 + 41 + 71}{3}) = 42.66 Average waiting time = (frac{0 + 4 + 46}{3}) = 16.66

Defined interactive system goals? List various interactive scheduling algorithms. Consider following process data and compute average waiting time and average turnaround time for RR(quantum 10) and priority scheduling algorithms.

PID Burst Time Arrival Time Priority

A 16 0 1

B 37 12 2

C 25 7 3

Leave your Answer:

Hits Counter

Question

Defined interactive system goals? List various interactive scheduling algorithms. Consider following process data and compute average waiting time and average turnaround time for RR(quantum 10) and priority scheduling algorithms. PID Burst Time Arrival Time Priority A 16 0 1 B 37 12 2 C 25 7 3

Leave your Answer:

Defined interactive system goals? List various interactive scheduling algorithms. Consider following process data and compute average waiting time and average turnaround time for RR(quantum 10) and priority scheduling algorithms.

PID Burst Time Arrival Time Priority

A 16 0 1

B 37 12 2

C 25 7 3