|
|
|
|
|
|
| 9/2/19 |
Introduction |
Probability review: 3.5, 3.6, 3.7, 3.9, 3.14, 3.19 (due Weds. 9/11 in class, optional but recommended!) | Ch. 1 | |
| 9/9/19 |
Operational Laws Mon: Guide to problem classes Probability review |
HW1: 6.1, 6.2, 6.3, 6.4 (due Weds. 9/18 in class) |
Ch. 2 (please read before Monday's class) Ch. 6 (will cover on Monday) Ch. 3 (probability background; will review as needed on Weds.) |
Ch. 5 (time averages, ensemble averages, and convergence) |
| 9/16/19 |
Modification Analysis |
HW2: 7.2, 7.3, 7.5 (due Weds. 9/25 in class) |
Ch. 7 (will cover on Monday) "Open Versus Closed: A Cautionary Tale" (read and summarize for Wednesday) Guide to summarizing papers |
|
| 9/23/18 | Discrete-Time Markov Chains |
HW3: 9.2a,b, 10.1, extra problem (due Weds. 10/2 in class) Note: 9.2b refers to "time-reversibility equations" and "balance equations." If you've read Ch. 9 and you know what these are, feel free to use the balance equations. Otherwise, use the stationary equations as we've done in class. |
Ch. 8 (will cover on Monday) "The PageRank Citation Ranking: Bringing Order to the Web" (read and summarize for Wednesday) |
Ch. 9 (ergodicity) "The Anatomy of a Large-Scale Hypertextual Web Search Engine" (more information about the structure of Google) |
| 9/30/19 |
Exponential Distribution and Poisson Process, CTMCs |
HW4: 11.2, 11.6, 13.5, 13.8 (due Weds. 10/9 in class) |
Ch. 11 (will cover on Monday) Ch. 12 (read before Wednesday) |
|
| 10/7/19 | M/M/1 and other (Markovian) queues | HW4.5: 13.5, 13.8 (if you didn't turn these in this week), 13.11 (due Weds. 10/16 in class) | Ch. 13-14 (will cover on Monday) | Ch. 16 (more on time-reversibility) |
| 10/14/19 | Real-world Workloads | HW5: 4.3, 20.1, see notes (due Weds. 10/23 in class) | Ch. 20 (will cover on Wednesday) | |
| 10/21/19 |
M/G/1 Queue and Inspection Paradox |
HW6: 23.2, 23.3, 23.4 (due Weds. 10/30 in class) |
Ch. 21.1-21.2, 23 (will cover on Monday) "Heterogeneity and Dynamicity of Clouds at Scale: Google Trace Analysis" (read and summarize for Wednesday) |
21.3-21.5 (solving complicated Markov chains) |
| 10/28/19 |
System modeling, M/G/1's, and final project |
|||
| 11/4/19 | Task Assignment | Final project proposal (due Weds. 11/6 in class) |
Ch. 24 (will cover on Monday) "Deciding Which Queue to Join: Some Counterexamples" (read and summarize for Wednesday) |
|
| 11/11/19 |
Scheduling Part 1 |
Ch. 28, 29 (will cover on Monday, skipping the part of Ch. 29 with transforms) Ch. 30 (will cover on Wednesday) |
||
| 11/18/19 | Scheduling Part 2 | Final project checkpoint (Weds. in class) | ||
| 11/25/19 |
|
|||
| 12/2/19 | Shortest Remaining Processing Time | |||
| 12/9/19 | Project Presentations | |||