CS 3733 Operating Systems, Spring 2008 Recitation Review

1. Recitation 1 Using the system
   In this recitation you learned how to compile programs on the Linux system and you write the get_filesize function.
2. Recitation 2: Timing and Static Variables
   In this recitation you experimented with the consequences of calling functions that use static variables.
3. Recitation 3: Interviewing
4. Recitation 4: The Process Scheduling Simulator
   In this recitation you started using the simulator and got ready for Assignment 2.
5. Recitation 5: The Process Scheduling Simulator continued
   In this recitation you modified the simulator input to do 5 experiments.
   There were 10 processes with short CPU bursts and 10 with longer ones.
   The algorithms used were FCFS, SJF, RR 1, RR 5 and RR 10.
   You should have found that in this case SJF had the best average waiting time and FCFS was next. Increasing the quantum for the RR produced better average waiting times and if it were allowed to increase above the largest CPU burst it would be identical to FCFS.
6. Recitation 6: Ring Simulator Introduction
   In this recitation you started using the simulator.
7. Recitation 7: Ring Simulator
   In this recitation you continued using the simulator. You should have found the following:
   • For the original ring, the order of the output is not predictable.
   • The order may change depending on how the processes are scheduled.
   • If each parent waits for its child before printing, the statements come out in reverse order of process creation.
   • If printing is not atomic, messages get jumbled up.

• Back to CS 3733 Homepage