Slides
Jump to navigation
Jump to search
Slides are only meant as supporting material for the lectures. The book and the supplementary material in the Docs & online resources section of the wiki will often include other useful information.
- Slides 1 - Overview and Nomenclature
- Slides 2 - Probability Refresher (1)
- Slides 3 - Probability Refresher (2)
- Slides 4 - Little's Law & Operational Laws
- Slides 5a - Discrete Time Markov Chains (DTMC) - an Overview
- Slides 5b - DTMC Examples
- Slides 6 - Ergodicity, Balance Equations, and Time Reversibility
- Slides 7 - Review of z-Transforms
- Slides 8 - Poisson & Exponential Distributions
- Slides 9 - CTMCs and M/M/* Queues
- Slides 10 - Provisioning and Overflow Systems
- Slides 11 - Reversibility, Burke's Theorem and Open and Closed Jackson Networks (spans roughly 3 lectures)
- Slides 12 - Brief Overview of Matrix Analytic Techniques
- Slides 13 - Processor Sharing Service Discipline
- Slides 14 - M/G/1 Queue and the Renewal Reward Theorem
- Slides 15 - Server Assignment Policies
- Slides 16 - Transform Analysis and Applications to M/G/1 Queue
- Slides 16bis - Brief Summary of Main Transform Relationships
- Slides 17 - M/G/1 Queue w/ Setup and Applications to Power Optimization
- Slides 18 - Scheduling - Non-Preemptive Policies
- Slides 19 - Scheduling - Non-Size-Based Preemptive Policies
- Slides 20 - Scheduling - Size-Based Preemptive Policies
