TheMultiplexer
/
Betriebssysteme
Vērot 1
Pievienot zvaigznīti 0
Atdalīts 0
Kods Problēmas 0 Izmaiņu pieprasījumi 0 Laidieni 0 Vikivietne Aktivitāte
Nav apraksta
Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.
187 Revīzijas
12 Atzari
Koks: 6acf783a10
Atzari Tagi
${ item.name }
Izveidot atzaru ${ searchTerm }
no '6acf783a10'
${ noResults }
Betriebssysteme/hw6/simu1/QUESTIONS.md

QUESTIONS.md 1.2KB
Vēsture Neapstrādāts

QUESTIONS: 9-Scheduling-Lottery

This program, lottery.py, allows you to see how a lottery scheduler works. See the README for details.

Warmup

  1. Compute the solutions for simulations with 3 jobs and random seeds of 1, 2, and 3.

Questions

  1. Now run with two specific jobs: each of length 10, but one (job 0) with just 1 ticket and the other (job 1) with 100 (e.g., -l 10:1,10:100).
    • What happens when the number of tickets is so imbalanced?
    • Will job 0 ever run before job 1 completes? How often?
    • In general, what does such a ticket imbalance do to the behavior of lottery scheduling?
  2. When running with two jobs of length 100 and equal ticket allocations of 100 (-l 100:100,100:100), how unfair is the scheduler? Run with some different random seeds to determine the (probabilistic) answer; let unfairness be determined by how much earlier one job finishes than the other.
  3. How does your answer to the previous question change as the quantum size (-q) gets larger?
  4. Can you make a version of the graph that is found in the chapter? What else would be worth exploring? How would the graph look with a stride scheduler?