Difference between revisions of "Slides"
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
* [https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Slides 1 - Overview and Nomenclature] | * [https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Slides 1 - Overview and Nomenclature] | ||
| − | * [ | + | * [https://drive.google.com/file/d/1CBuwgSx7-ucP90sHWzYLyeujDsynJq2R/view?usp=sharing Slides 2 - Probability Refresher (1)] |
| − | * [ | + | * [https://drive.google.com/file/d/1OPly_SmDUKxj9L4MOwLVcbHxBCCiLHz-/view?usp=sharing Slides 3 - Probability Refresher (2)] |
| − | * [ | + | * [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Slides 4 - Little's Law & Operational Laws] |
| − | * [ | + | * [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Slides 5a - Discrete Time Markov Chains (DTMC) - an Overview] |
| − | * [ | + | * [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Slides 5b - Ergodicity, Balance Equations, and Time Reversibility] |
| − | * [ | + | * [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing Slides 6 - Review of ''z''-Transforms] |
| − | * [ | + | * [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing Slides 7 - DTMC Examples] |
| − | * [ | + | * [https://drive.google.com/file/d/1rdxgipPS2k9dTKJnu4i9ilxAL72FhcvO/view?usp=sharing Slides 8 - Poisson & Exponential Distributions] |
| − | * [ | + | * [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Slides 9 - CTMCs and M/M/* Queues] |
| − | * [ | + | * [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Slides 10 - Provisioning and Overflow Systems] |
| − | * [ | + | * [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Slides 11 - Reversibility, Burke's Theorem and Open and Closed Jackson Networks] |
| − | * [ | + | * [https://drive.google.com/file/d/10GbBezwlKDF6JN-OYqjug37L1p-BTfbE/view?usp=sharing Slides 12 - Brief Overview of Matrix Analytic Techniques] |
| − | * [ | + | * [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Slides 13 - Processor Sharing Service Discipline] |
| − | * [ | + | * [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing Slides 14 - M/G/1 Queue and the Renewal Reward Theorem] |
| − | * [ | + | * [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Slides 15 - Server Assignment Policies] |
| − | * [ | + | * [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Slides 16 - Transform Analysis and Applications to M/G/1 Queue] |
| − | * [ | + | * [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Slides 16bis - Brief Summary of Main Transform Relationships] |
| − | * [ | + | * [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing Slides 17 - M/G/1 Queue w/ Setup and Applications to Power Optimization] |
| − | * [ | + | * [https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Slides 18 - Scheduling - Non-Preemptive Policies] |
| − | * [ | + | * [https://drive.google.com/file/d/1NzfRew8bboymNXLyrDDWYArxsGAPPWJ0/view?usp=sharing Slides 19 - Scheduling - Non-Size-Based Preemptive Policies] |
| − | * [ | + | * [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Slides 20 - Scheduling - Size-Based Preemptive Policies] |
Revision as of 01:01, 7 March 2020
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 - Ergodicity, Balance Equations, and Time Reversibility
- Slides 6 - Review of z-Transforms
- Slides 7 - DTMC Examples
- 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
- 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
