Beyond Physical Memory

CSC 213 - Operating Systems and Parallel Algorithms - Weinman



Answer the following questions. Record your answers in your Reading Journal.
  1. Convert the hardware control flow algorithm of Figure 20.2 (p. 7) in to a flow chart. Use boxes for steps/computations, diamonds for conditionals, and ovals for exceptions. The example below gives a potential start. You need not create a digital copy to post (though you may), but you should bring it to class to compare.
    AD-20-21-flow.png
  2. Explain, as you might to Professor Weinman's 11-year old niece, the notion of the proactive, watermark aware page daemon. Though she probably doesn't understand computer systems as well as you do, she understands the efficiencies of her own world (11-year olds have their own metrics).
  3. Describe an example from your own experience where you have applied Belady's optimal replacement policy. Briefly (3-5 sentences) explain the scenario and how your choices would be optimal.