OS Process Scheduling

1. Exercise 3.6 on page 144 (Exercise 3.1 on page 125 for version 7). Describe the difference among short-term, medium-term, and long-term scheduling.

2. Exercise 4.10 on page 182 (Exercise 4.4 on page 159 for version 7). Which of the following components of program state are shared across threads in a multithreaded process?

• a. Register values
• b. Heap memory
• c. Global variables
• d. Stack memory.

3. Exercise 5.12 on page 235 (Exercise 5.4 on page 205 for version 7).

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

Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

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 smaller priority number implies a higher priority), and RR (Quantum =1)
• b. What is the turnaround time of each process for each of these scheduling algorithms? Give a table to list all results.
• c. what is the waiting time of each process for each of the scheduling algorithms? Give a table to list all results.
• d. which of the algorithms results in the minimum average waiting time (over all processes)