Scribd
Upload
3 views1 page

CPU Scheduling Activity

The document outlines a CPU scheduling exercise involving five processes with specified burst times and priorities. It requires the creation of Gantt charts for four scheduling algorithms: FCFS, SJF, non-preemptive priority, and RR with a quantum of 2. Additionally, it asks for the turnaround and waiting times for each process under these algorithms and identifies which algorithm yields the minimum average waiting time.

Uploaded by

Guan Lhei
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

CPU Scheduling Activity

The document outlines a CPU scheduling exercise involving five processes with specified burst times and priorities. It requires the creation of Gantt charts for four scheduling algorithms: FCFS, SJF, non-preemptive priority, and RR with a quantum of 2. Additionally, it asks for the turnaround and waiting times for each process under these algorithms and identifies which algorithm yields the minimum average waiting time.

Uploaded by

Guan Lhei
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Republic of the Philippines

BATANGAS STATE UNIVERSITY


The National Engineering University
Lipa Campus
A. Tanco Drive, Marawoy, Lipa City, Batangas, Philippines 4217
T el Nos.: (+63 43) 980-0385; 980-0387; 980-0392 to 94 loc. 3129
E-mail Address: [Link]@[Link] | Website Address: [Link]

CPU SCHEDULING. Do as indicated. Show your complete solution. Box your final answer.

1. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

Process Burst 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, non-preemptive priority and RR (quantum = 2) scheduling.

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

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

d. Which of the algorithms result in the minimum average waiting time (over all processes)?

You might also like