# Homework 3

Due Date: May 18, 1999
Points: 100

These can be answered in a sentence or two, and are intended to reinforce important points.

1. (4 points) Describe the differences between short term, medium term, and long term scheduling.
2. (3 points) State the difference between preemptive and non-preemptive scheduling algorithms.
3. (3 points) What is "device independence"? (Tanenbaum, problem 3-7)

These questions require some thought and longer answers than the short-answer questions. They are intended to have you use the concepts discussed in class, to be sure you understand them and can work with them.

1. (30 points) Consider the following process arrival list:
job namearrival timeservice time
A010
B21
C32
D77
E85
For each process, give the time(s) that the process acquires the CPU, relinquishes the CPU, and the turnaround time, the waiting time, and the response ratio for each of the following job scheduling algorithms:
1. First Come, First Serve
2. Shortest Job Next
3. Shortest Remaining Time Next
4. Highest Response Ratio Next
5. Round Robin with a quantum of 1
6. Multilevel Feedback Queue with 3 queues, the first two being round robin with quanta of 2 and 4, respectively, and the lowest being first come first serve.
2. (20 points) An operating system designer has proposed a multilevel feedback queueing scheme in which there are five levels. The quantum at the first level is 0.5 seconds, and each lower level has a quantum twice the size of the quantum at the previous level. A process cannot be pre-empted until its quantum expires, and then it is moved to the next lower queue (unless it is in the lowest queue, of course). If the process does I/O, upon completion it is returned to the queue from which it left. The system runs both batch and interactive jobs, and these, in turn, consist of both CPU-bound and I/O-bound jobs.
1. Why is this scheme deficient?
2. What minimal changes would you propose to make the scheme more acceptable for its intended job mix?
3. (20 points) This question asks you to compare different disk scheduling policies.
1. Under very light loads, all the disk scheduling policies we have discussed degenerate into which policy? Why?
2. Will requests scheduled by a FCFS disk scheduling policy ever have a lower mean waiting time than those scheduled by a SCAN policy? Than those scheduled by a SSTF policy? Justify your answers. (Hint: consider a system on which a seek takes 0.5 + 0.4T msec, where T is the number of cylinders moved. Then assume the arm is initially at cylinder 100, the disk has 200 cylinders, and the arm is moving inward.)
4. (20 points) To what extent does the theory of disk-head scheduling apply to magnetic tapes?

## Extra Credit

1. (10 points) Tanenbaum, and many other authors, refer to the LOOK and SCAN algorithms as "elevator algorithms." What is the major conceptual difference between disk scheduling and "elevator scheduling"? (Hint: are we trying to minimize elevator movement?) Send email to cs150@csif.cs.ucdavis.edu.

Department of Computer Science
University of California at Davis
Davis, CA 95616-8562