Logo
ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > CLASS (2016-2017-1)-62903-06102-1 > 2014329600005_胡悦 >
Homework_02 Version 0
👤 Author: by 2014329600005valerie 2016-12-23 18:20:46
5.4 Consider the following set of processes, with the length of the CPU brust given in milliseconds:
IMG_8133
The processes are assumed to have arrivedin the order p1, p2, p3, p4, p5, all at time 0.

a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithm: FCFS, SJF, nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 1).
PIC_20161007_190906_104

b. What is the turnaround time of each process for each of the scheduling algorithms in part a?
PIC_20161007_191213_08B

c.What is the waiting time of each process for each of the scheduling algorithms in part a?
PIC_20161007_191554_2C2

d. Which of the algorithms in part a results in the minimum average wating time (over all processes)?
SJF (Shortest Job First)

Please login to reply. Login

Reversion History

Loading...
No reversions found.