Chapter 2: Process Management

2.3. CPU Scheduling

1 A CPU-scheduling algorithm determines an order for the execution of its scheduled processes.
Given n processes to be scheduled on one processor, how many different schedules are possible?
Give a formula in terms of n.

DA: n!
2 Explain the difference between preemptive and nonpreemptive scheduling.
DA:

1. In preemptive scheduling, the CPU is allocated to the processes

for a limited time whereas, in Non-preemptive scheduling, the
CPU is allocated to the process till it terminates or switches to the
waiting state.
2. The executing process in preemptive scheduling is interrupted in
the middle of execution when higher priority one comes whereas,
the executing process in non-preemptive scheduling is not
interrupted in the middle of execution and waits till its execution.
3. In Preemptive Scheduling, there is the overhead of switching the
process from the ready state to running state, vise-verse and
maintaining the ready queue. Whereas in the case of non-
preemptive scheduling has no overhead of switching the process
from running state to ready state.
4. In preemptive scheduling, if a high-priority process frequently
arrives in the ready queue then the process with low priority has
to wait for a long, and it may have to starve. , in the non-
preemptive scheduling, if CPU is allocated to the process having
a larger burst time then the processes with small burst time may
have to starve.
5. Preemptive scheduling attains flexibility by allowing the critical
processes to access the CPU as they arrive into the ready queue,
no matter what process is executing currently. Non-preemptive
scheduling is called rigid as even if a critical process enters the
ready queue the process running CPU is not disturbed.
 6. Preemptive Scheduling has to maintain the integrity of shared
data that’s why it is cost associative which is not the case with
Non-preemptive Scheduling.
3 Suppose that the following processes arrive for execution at the times indicated. Each process will
run for the amount of time listed. In answering the questions, use nonpreemptive scheduling, and
base all decisions on the information you have at the time the decision must be made.

a. What is the average turnaround time for these processes with the FCFS scheduling algorithm?
b. What is the average turnaround time for these processes with the SJF scheduling algorithm?
c. The SJF algorithm is supposed to improve performance, but notice that we chose to run process
P1 at time 0 because we did not know that two shorter processes would arrive soon. Compute what
the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF
scheduling is used. Remember that processes P1 and P2 are waiting during this idle time, so their
waiting time may increase. This algorithm could be called future-knowledge scheduling.
4 What advantage is there in having different time-quantum sizes at different levels of a multilevel
queueing system?

Processes which need more frequent servicing, for instance interactive

processes such as editors, can be in a queue with a small time quantum.
Processes with no need for frequent servicing can be in a queue with a larger
quantum, requiring fewer context switches to complete the processing; making
more efficient use of the computer.

5 Many CPU-scheduling algorithms are parameterized. For example, the RR algorithm requires a
parameter to indicate the time slice. Multilevel feedback queues require parameters to define the
number of queues, the scheduling algorithmfor each queue, the criteria used tomove processes
between queues, and so on. These algorithms are thus really sets of algorithms (for example, the set
of RR algorithms for all time slices, and so on). One set of algorithms may include another (for
example, the FCFS algorithmis the RR algorithm with an infinite time quantum).What (if any)
relation holds between the following pairs of algorithm sets?

a. Priority and SJF

SJF is a special case of priority cheduling. Priority in SJF is inverse ò (predicted) next CPU burst.
b. Multilevel feedback queues and FCFS
Multilevel feedback queue scheduling includes FCFS algorithm in queues of lower priority
 c. Priority and FCFS
Not related
d. RR and SJF
Not related

6 Suppose that a scheduling algorithm (at the level of short-term CPU scheduling) favors those
processes that have used the least processor time in the recent past. Why will this algorithm favor
I/O-bound programs and yet not permanently starve CPU-bound programs?

It will favor the I/O bound programs because of the relatively short CPU burst
request by them; however, the CPU-bound programs will not starve because the
I/O-bound programs will relinquish the CPU relatively often to do their I/O.
7 Distinguish between PCS and SCS scheduling.

PCS scheduling is completed locally to the process. It is how a thread

library schedules threads onto available LWPs. SCS scheduling is the
circumstances where the operating system schedules kernel threads
8 Assume that an operating system maps user-level threads to the kernel using the many-to-many
model and that the mapping is done through the use of LWPs. Furthermore, the system allows
program developers to create real-time threads. Is it necessary to bind a real-time thread to an
LWP?
Yes. Timing is crucial to real-time applications. If a thread is marked as real-time but is not bound to
an LWP, the thread may have to wait to be attached to an LWP before running. Consider if a real-
time thread is running (is attached to an LWP) and then proceeds to block (i.e. must perform I/O, has
been preempted by a higher-priority real-time thread, is waiting for a mutual exclusion lock, etc.)
While the real-time thread is blocked, the LWP itwas attached to has been assigned to another
thread. When the real-time thread has been scheduled to run again, it must first wait to be attached
to an LWP. By binding an LWP to a realtime
thread you are ensuring the thread will be able to run with minimal delay once it is scheduled.

9 The traditional UNIX scheduler enforces an inverse relationship between priority numbers and
priorities: the higher the number, the lower the priority. The scheduler recalculates process
priorities once per second using the following function:
Priority = (recent CPU usage / 2) + base
where base = 60 and recent CPU usage refers to a value indicating how often a process has used the
CPU since priorities were last recalculated.
Assume that recent CPU usage is 40 for process P1, 18 for process P2, and 10 for process P3. What
will be the new priorities for these three processes when priorities are recalculated? Based on this
information, does the traditional UNIX scheduler raise or lower the relative priority of a CPU-
bound process?
10 Why is it important for the scheduler to distinguish I/O-bound programs from CPU-bound
programs?

 I/O-bound programs have the property of performing only a small amount

of computation before performing I/O. Such programs typically do not use
up their entire CPU quantum.
11 Discuss how the following pairs of scheduling criteria conflict in certain settings.
a. CPU utilization and response time
b. Average turnaround time and maximum waiting time
c. I/O device utilization and CPU utilization
12 One technique for implementing lottery schedulingworksbyassigning processes lottery tickets, which
are used for allocating CPU time.Whenever a scheduling decision has to be made, a lottery ticket is
chosen at random, and the process holding that ticket gets the CPU.The BTV operating system
implements lottery scheduling by holding a lottery 50 times each second, with each lottery winner getting
20 milliseconds of CPU time (20 milliseconds × 50 = 1 second). Describe how the BTV scheduler can
ensure that higher-priority threads receivemore attention from the CPU than lower-priority threads.
13 In Chapter 5, we discussed possible race conditions on various kernel data structures. Most scheduling
algorithms maintain a run queue, which lists processes eligible to run on a processor.Onmulticore
systems, there are two general options: (1) each processing core has its own run queue, or (2) a single run
queue is shared by all processing cores. What are the advantages and disadvantages of each of these
approaches?
14 Consider the exponential average formula used to predict the length of the next CPU burst.What are
the implications of assigning the following values to the parameters used by the algorithm?

a.  = 0and 0 = 100 milliseconds

b.  = 0.99 and 0 = 10 milliseconds

15 A variation of the round-robin scheduler is the regressive round-robin scheduler. This scheduler
assigns each process a time quantum and a priority. The initial value of a time quantumis
50milliseconds.However, every time a process has been allocated the CPU and uses its entire time
quantum (does not block for I/O), 10 milliseconds is added to its time quantum, and its priority level is
boosted. (The time quantum for a process can be increased to a maximum of 100 milliseconds.) When a
process blocks before using its entire time quantum, its time quantum is reduced by 5 milliseconds, but its
priority remains the same.What type of process (CPU-bound or I/O-bound) does the regressive round-
robin scheduler favor? Explain.
16 Consider the following set of processes, with the length of the CPU burst given in milliseconds:
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, nonpreemptive priority (a larger priority number implies a higher priority), and
RR (quantum = 2).
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 these scheduling algorithms?
d. Which of the algorithms results in the minimum average waiting time (over all processes)?

17 The following processes are being scheduled using a preemptive, round-robin scheduling algorithm.
Each process is assigned a numerical priority, with a higher number indicating a higher relative priority.
In addition to the processes listed below, the system also has an idle task (which consumes no CPU
resources and is identified as Pidle ). This task has priority 0 and is scheduled whenever the system has no
other available processes to run. The length of a time quantum is 10 units. If a process is preempted by a
higher-priority process, the preempted process is placed at the end of the queue.

a. Show the scheduling order of the processes using a Gantt chart.

b. What is the turnaround time for each process?
c. What is the waiting time for each process?
d. What is the CPU utilization rate?
18 The nice command is used to set the nice value of a process on Linux, as well as on other UNIX
systems. Explain why some systemsmay allow any user to assign a process a nice value >= 0 yet allow
only the root user to assign nice values < 0.
19 Which of the following scheduling algorithms could result in starvation?
a. First-come, first-served
b. Shortest job first
c. Round robin
d. Priority
20 Consider a variant of the RR scheduling algorithm in which the entries in the ready queue are pointers
to the PCBs.
a. What would be the effect of putting two pointers to the same process in the ready queue?
b. What would be two major advantages and two disadvantages of this scheme?
c. Howwould youmodify the basic RR algorithmto achieve the same effect without the duplicate pointers?
21 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 operation 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.1millisecond and that
all processes are long-running tasks. Describe the CPU utilization for a round-robin scheduler when:
a. The time quantum is 1 millisecond
b. The time quantum is 10 milliseconds
22 Consider a system implementing multilevel queue scheduling. What strategy can a computer user
employ to maximize the amount of CPU time allocated to the user’s process?
23 Explain the differences in how much the following scheduling algorithms discriminate in favor of
short processes:
a. FCFS
b. RR
c. Multilevel feedback queues