For questions 1-3, use the following table and perform the scheduling algorithms

Question

For questions 1-3, use the following table and perform the scheduling algorithms below.

Show the graphical view of how the jobs run. Also show the following results for each process: Finish Time, Tr, and Tr/Ts.

     Process     Arrival Time      Service Time

A            0                 3

B            1                 4

C            3                 5

D            5                 2

E            7                 3

1) RR (quantum=1)

2) HRRN

3) Feedback (use 3 queues, quantum=1 for each queue)

4) Which granularity of parallelism most affects the scheduling algorithm we use? Explain why.

5) What is the benefit of gang scheduling?

6) What is an "immediate preemptive scheduler"?

Explanation / Answer

(1)

Total no of process:5
Given burst time of P1:0
Given burst time of P2:1
Given burst time of P3:3
Given burst time of P4:5
Given burst time of P5:7
Given quantum time:1
so process allocation will be for 1 slot for every process unti it is completely executed
P2 P3 P4 P5 P3 P4 P5 P3 P4 P5 P4 P5 P4 P5 P5 P5
Process Burst    Waiting    Turnaround
P1        0     0         0
P2         1     0         1
P3         3    5        8
P4         5     8         13
P5         7     9         16
Average waiting time:---------->4
Average Turnaround time:----->7

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.