Advanced Scheduling

CSC 213 - Operating Systems and Parallel Algorithms - Weinman



Answer the following questions. Record your answers in your Reading Journal.
  1. Andrew S. Tanenbaum writes in Modern Operating Systems (2008)
    CTSS had the problem that process switching was very slow because the [machine] could hold only one process in memory. Each switch meant swapping the current proces to disk and reading in a new one from disk. The CTSS designers quickly realized that it was more efficient to give CPU-bound processes a large quantum once in a while, rather than giving them a small quanta frequently (pp. 156-157)
    Identify the sentence from today's reading that is most closely related. Briefly (3-5 sentences) explain whether your choice supports, denies, or complicates the designer's story.
  2. Identify among MLFQ Rules 1-4b which you believe is most important. Briefly explain why you chose this rule.
  3. Briefly explain whether the rule you selected has a greater impact on turnaround time or response time.