KEMBAR78
CPU Scheduling 3 | PDF | Teaching Methods & Materials | Technology & Engineering
0% found this document useful (0 votes)
54 views1 page

CPU Scheduling 3

operating systems

Uploaded by

Kashif Amjad
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
0% found this document useful (0 votes)
54 views1 page

CPU Scheduling 3

operating systems

Uploaded by

Kashif Amjad
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
You are on page 1/ 1

CPU Scheduling Exercises

Consider the following set of jobs to be scheduled for execution on a single CPU system.

(a) Draw a Gantt chart showing FCFS scheduling for these jobs.

(b) Draw a Gantt chart showing (non-preemptive) SJF scheduling.

(c) Draw a Gantt chart showing non-preemptive PRIORITY scheduling.

(d) Draw a Gantt chart showing preemptive PRIORITY scheduling.

(e) Which of the foregoing scheduling policies provides the lowest waiting time for this
set of jobs? What is the waiting time with this policy?

You might also like