Difference between revisions of "Slides"
Jump to navigation
Jump to search
| (19 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
Slides are only meant as supporting material for the lectures. The book and the supplementary material in the [[online|''Docs & online resources'']] section of the wiki will often include other useful information. | Slides are only meant as supporting material for the lectures. The book and the supplementary material in the [[online|''Docs & online resources'']] section of the wiki will often include other useful information. | ||
| − | * [ | + | * [https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Overview and Nomenclature] |
| − | * [ | + | * [https://docs.google.com/presentation/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/edit?usp=sharing&ouid=112223552596975457559&rtpof=true&sd=true Probability Refresher] |
| − | * [ | + | <!--* [https://drive.google.com/file/d/1CBuwgSx7-ucP90sHWzYLyeujDsynJq2R/view?usp=sharing Probability Refresher (1)] |
| − | * [ | + | * [https://drive.google.com/file/d/1OPly_SmDUKxj9L4MOwLVcbHxBCCiLHz-/view?usp=sharing Probability Refresher (2)]--> |
| − | * [ | + | * [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little's Law & Operational Laws] |
| − | * [[ | + | * [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains (DTMC) - an Overview] |
| − | * [ | + | * [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples] |
| − | + | * [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity, Balance Equations, and Time Reversibility] | |
| − | * [ | + | * [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing Review of ''z''-Transforms] |
| − | * [ | + | * [https://drive.google.com/file/d/1N_FjkEftjkBNqMCpMKAJ-VgpU1awAjNH/view?usp=sharing Poisson & Exponential Distributions] |
| − | * [ | + | * [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing CTMCs and M/M/* Queues] |
| − | * [ | + | * [https://drive.google.com/file/d/1bcQGnc85sFVHpglPyiO0T3c7IWsI5b7Z/view?usp=sharing Provisioning and Overflow Systems] |
| − | * [ | + | * [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Reversibility, Burke's Theorem and Open and Closed Jackson Networks (spans roughly 3 lectures)] |
| − | * [ | + | * [https://drive.google.com/file/d/1vhr49YMs0f6VKwbxcPpPktiFoadph-Ia/view?usp=sharing Brief Overview of Matrix Analytic Techniques] |
| − | * [ | + | * [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Processor Sharing Service Discipline] |
| − | * [ | + | * [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing M/G/1 Queue and the Renewal Reward Theorem] |
| + | * [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Server Assignment Policies] | ||
| + | * [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Transform Analysis and Applications to M/G/1 Queue] | ||
| + | ** [https://drive.google.com/file/d/1SOUitd-wS3vj-EC4IKVtMTCX_i_GfIfj/view?usp=sharing Summary of Main Transform Relationships] | ||
| + | ** [https://drive.google.com/file/d/1m93Jf9U95wCzMPpPl6N2WC2pHnB1-1QI/view?usp=sharing Finite M/G/1 Queue] | ||
| + | * [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing M/G/1 Queue w/ Setup and Applications to Power Optimization] | ||
| + | * [https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Scheduling - Non-Preemptive Policies] | ||
| + | <!--* [https://drive.google.com/file/d/1EBTZy-G_0sqR2b71MVYZfbloYZWI7vEW/view?usp=sharing Scheduling - Preemptive Policies]--> | ||
| + | * [https://drive.google.com/file/d/1Af2GKXJB83TV_DduVbjk_PXajM8pQPns/edit?usp=share_link&ouid=112223552596975457559&rtpof=true&sd=true Scheduling - Non-Size-Based Preemptive Policies] | ||
| + | * [https://drive.google.com/file/d/1crYbj01bzna-MvRNP0yw-3_4gMQcBd6z/view?usp=sharing Scheduling - Size-Based Preemptive Policies] | ||
Latest revision as of 21:01, 13 November 2024
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.
- Overview and Nomenclature
- Probability Refresher
- Little's Law & Operational Laws
- Discrete Time Markov Chains (DTMC) - an Overview
- DTMC Examples
- Ergodicity, Balance Equations, and Time Reversibility
- Review of z-Transforms
- Poisson & Exponential Distributions
- CTMCs and M/M/* Queues
- Provisioning and Overflow Systems
- Reversibility, Burke's Theorem and Open and Closed Jackson Networks (spans roughly 3 lectures)
- Brief Overview of Matrix Analytic Techniques
- Processor Sharing Service Discipline
- M/G/1 Queue and the Renewal Reward Theorem
- Server Assignment Policies
- Transform Analysis and Applications to M/G/1 Queue
- M/G/1 Queue w/ Setup and Applications to Power Optimization
- Scheduling - Non-Preemptive Policies
- Scheduling - Non-Size-Based Preemptive Policies
- Scheduling - Size-Based Preemptive Policies
