The following table represents a set of 5 processes, and their arrival and servi

Question

The following table represents a set of 5 processes, and their arrival and service times accordingly. Given these processes simulate the following two process scheduling policies. Show a timeline/diagram that traces the execution of each process for each discrete time step (for example, simply giving AABCDDAA... as your timeline is sufficient).

Simulate a Round-Robin policy with a time slice quantum of 2. Remember that if a process arrives at the same time that the running processes time slice quantum expires, by convention we will determine that the arriving process is placed on the round robin queue first, then the expiring process is placed back on the queue after any arriving processes.

Also simulate a highest response ratio next (HRRN) policy. Recall that HRRN is non-preemptive, and it decides which process to run when the current process finishes by calculating the ratio R = (w + s) / s where w is the time spent waiting so far and s is the expected service time. If 2 processes have the same response ratio when a scheduling decision needs to be made, fall back to selecting the process that has been waiting the longest.

Explanation / Answer

1. Round Robin(quantum = 2)

0------2------3-------5--------7------9-------11------13------15------17-----18------19-----20-----21

2. HRRN

A arrives first so execute first. At arrival time 6, B,C and D are ready to execute

R[B] = (3+5)/5 = 1.6

R[C] = (1+4)/4 = 1.25

R[D] = (0+3)/3 = 1

So B, C and D will execute in order after A and then E

Do aski fi any doubt. Please upvote.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

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