CSC325_s2
Running Page: COMPUTER ANALOGY 1
Running Head: COMPUTER ANALOGY 2
1. Consider the following set of processes, with the length of the CPU time given in milliseconds:
|
Process |
CPU Time |
Priority |
|
P1 |
2 |
2 |
|
P2 |
1 |
1 |
|
P3 |
8 |
4 |
|
P4 |
4 |
2 |
|
P5 |
5 |
3 |
The processes are assumed to have arrived in 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 algorithms: FCFS, SJF, priority (a smaller priority number implies a higher priority), and RR (quantum = 2).
b. What is the waiting time of each process for each of these scheduling algorithms?
c. Which of the algorithms results in the minimum average waiting time (over all processes)?