Process Management

SLP Assignment
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)?

SLP Assignment Expectations

Use information from the modular background readings as well as the given resources. Also, you could use any good quality resource you can find. Please cite all sources and provide a reference list at the end of your paper.

Length: 1–2 pages (excluding the title page and reference pages) and double-spaced.

The following items will be assessed in particular:
1.Your ability to consolidate ideas from reading materials and your understanding of the materials.
2.Your ability to write a report with strong argument.
3.Some in-text references to modular background readings.