Process Scheduling

Sheet 4

1-Why we need process scheduling? what are the criteria that should be
considered with the scheduling algorithms.
The aim of processor scheduling is to assign processes to be executed by the
processor or processors over time, in a way that meets system objectives, such as:
 - minimize response time,
 - maximize throughput, and
 - high processor efficiency
Scheduling Criteria:
 Max CPU utilization
 •Max throughput
 •Min turnaround time
 •Min waiting time
 •Min response time

2-Define the following terms:

 Throughput – number of processes that completed their execution per time
unit

 Turnaround time – amount of time to execute a particular process (interval

from the time of submission of a process to the time of completion

 Waiting time – amount of time a process has been waiting in the ready queue

 Response time – amount of time it takes from when a request was submitted
until the first response is produced, not output.

3-What are the objectives of process scheduling algorithms?

 minimize response time,
 - maximize throughput, and
 - high processor efficiency
4-State the situations in which the operating system should decide to
perform process scheduling.
  The objective of multiprogramming is to have some process running at all
times, to maximize CPU utilization.
 •The idea is relatively simple. A process is executed until it must wait for some
event such as the completion of some I/O request.
 In a simple computer system, the CPU then just sits idle. All this waiting time is
wasted; no useful work is accomplished.
 •With multiprogramming, several processes are kept in memory at one time.
When one process has to wait, it should be replaced with another process.

5- Starvation is a problem occurs with some of the process scheduling

algorithms. Explain this problem and how can the system recover from it?
 Starvation – low priority processes may never execute
 •Solution ≡ Aging – as time progresses increase the priority of the process