Scribd
Upload
3 views1 page

scheduling_hw

The document outlines a scheduling assignment with processes and their attributes, requiring the creation of Gantt charts for various scheduling algorithms including FCFS, SJF, nonpreemptive priority, and RR. It also asks for turnaround and waiting times for each algorithm, as well as an analysis of CPU utilization for I/O bound and CPU-bound tasks under different time quantums. Additionally, it discusses strategies for maximizing CPU time in multi-level queue scheduling and compares the discrimination of different scheduling algorithms.

Uploaded by

Deadly Chiller
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

scheduling_hw

The document outlines a scheduling assignment with processes and their attributes, requiring the creation of Gantt charts for various scheduling algorithms including FCFS, SJF, nonpreemptive priority, and RR. It also asks for turnaround and waiting times for each algorithm, as well as an analysis of CPU utilization for I/O bound and CPU-bound tasks under different time quantums. Additionally, it discusses strategies for maximizing CPU time in multi-level queue scheduling and compares the discrimination of different scheduling algorithms.

Uploaded by

Deadly Chiller
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

Scheduling

Deadline: 05/12/2011 (Due in class)

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

Process Burst Time Priority


P1 11 3
P2 3 1
P3 2 2
P4 1 4
P5 5 2
The process are assumed to arrive in the order P1 , P2 , P3 , P4 , P5 , all at time 0.

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

(b) What is the turnaround time of each process for each of the algorithms?

(c) What is the waiting time of each process for each of the algorithms?

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

2. Consider a system running ten I/O bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue
an I/O oeration once for every millisecond of CPU computing and that each I/O operation takes 10 milliseconds to
complete. Also assume that the context-switching overhead is 0.1 millisecond and that all processes are long-term
tasks. Describe the CPU utilization for a round-robin scheduler when

• the time quantum is 1 millisecond

• the time quantum is 10 milliseconds.

3. Consider a system implementing multi-level queue scheduling. What strategy can a computer user employ to
maximize the amount of CPU time allocated to the user’s process?
4. Explain the differences in the degree to which the following scheduling algorithms discriminate in favor of short
processes:

• FCFS

• RR

• Multilevel Feedback Queue

5. Consider n processes sharing the CPU in a RR fashion.

• Assuming that each context switch takes s milliseconds, determine the quantum size q such that the overhead
resulting from process switching is minimized but, at the same time, each process is guaranteed to get its turn at
the CPU at least every t seconds.

• if n = 100, t = 1, and s = 0.001, what would be the size of q? What is s is increased to 0.01?

ECS 150 -1- Spring 2011

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy