Difference between revisions of "Syllabus"
Jump to navigation
Jump to search
| Line 57: | Line 57: | ||
</span> --> | </span> --> | ||
| − | ===<!--<span style="color: red">-->Zoom access of live lectures WHEN OFFERED (see [[Main Page#zoom|Zoom & Video Access]]) will be through [https://wustl.instructure.com/courses/ | + | ===<!--<span style="color: red">-->Zoom access of live lectures WHEN OFFERED (see [[Main Page#zoom|Zoom & Video Access]]) will be through [https://wustl.instructure.com/courses/133964/external_tools/1199 Canvas]<!--</span>-->=== |
===Detailed Schedule & Syllabus=== | ===Detailed Schedule & Syllabus=== | ||
| Line 77: | Line 77: | ||
| U0 || 8/28 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 & 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]<br/>[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro & Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || | | U0 || 8/28 || Course overview, logistics, (motivating) examples and terminology || Chapters 1 & 2 ||[https://drive.google.com/file/d/1VrYQ3m_D4chX9ZcCM-Sq541Zyl81VfzT/view?usp=sharing Notes 0]<br/>[https://drive.google.com/file/d/1yhMfOnRS2IHfR4G7Lx9MQ4ihGKCy0IzC/view?usp=sharing Intro & Nomenclature] || [https://drive.google.com/file/d/17vtkuQ_hN1ZNREVglsNEzusA9VPQQt3F/view?usp=sharing Preview Problems 1] || | ||
|- | |- | ||
| − | | U1 || 8/30 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 & 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://wustl.instructure.com/courses/ | + | | U1 || 8/30 || A brief review of probability topics, both basic and slightly more advanced, which are needed in the course || Chapters 3 & 5 || [https://drive.google.com/file/d/1Q6qVcMzHMLi7M0TiQukYyL1nAnkYO2Q0/view?usp=sharing Probability Refresher] and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit Practice Problems for U1] ||[https://drive.google.com/file/d/1Nk227qMaiuuBuUkMI0vH6CM4RNRIamgz/view?usp=sharing Preview Problems 2] || |
|} | |} | ||
| Line 96: | Line 96: | ||
| || 9/6 || An introduction of general principles such as Little's Law and various other "laws" and bounds for closed system, which hold with little or no assumptions || Chapters 6 & 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little & Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3 & 4] || | | || 9/6 || An introduction of general principles such as Little's Law and various other "laws" and bounds for closed system, which hold with little or no assumptions || Chapters 6 & 7|| [https://drive.google.com/file/d/1rMNMujiCO84xGPebp4OFd59xGEIV6crG/view?usp=sharing Little & Operational Laws] || [https://drive.google.com/file/d/1E1S1zW1S2F457RS0p40r1LvqiDlbXf3B/view?usp=sharing Preview Problems 3 & 4] || | ||
|- | |- | ||
| − | | U2 || 9/11 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]<br/> and [https://wustl.instructure.com/courses/ | + | | U2 || 9/11 || A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. || Chapter 8 (Sections 8.1 to 8.7) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]<br/> and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit Web caching as a DTMC in U2 Practice Problems] || [https://drive.google.com/file/d/1sKWZcE0EON_2M2nkpUtr733nqedesPgl/view?usp=sharing Preview Problems 5]] ||style="background-color: SkyBlue;"|[https://drive.google.com/file/d/1kC81pnb9krjMZ10UMOAwFycV8T0fsePx/view?usp=sharing HWK #1] |
|- | |- | ||
| U2 || 9/13 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]<br/> and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style="background-color: SpringGreen;"| Quiz 1 | | U2 || 9/13 || Infinite DTMCs and some simple applications || Chapter 8 (Sections 8.8 to 8.10) || [https://drive.google.com/file/d/1K1_1wcx5D9yExRXPstvvAWHxW53hTqe6/view?usp=sharing Discrete Time Markov Chains]<br/> and [https://drive.google.com/file/d/1Y8gR6tWmiM_SLuY5kVmzeXRSepQWNZR9/view?usp=sharing DTMC Examples] || [https://drive.google.com/file/d/1n3yth3WxfcYej5lyOA8ruxO22b6yG_RW/view?usp=sharing Preview Problems 6] ||style="background-color: SpringGreen;"| Quiz 1 | ||
| Line 102: | Line 102: | ||
| U2 || 9/18 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7] | | U2 || 9/18 || Ergodicity, balance equations, and time reversibility for DTMCs || Chapter 9 || [https://drive.google.com/file/d/1WRSpjPc57T3f_KjrETWW58M5GiLfEodU/view?usp=sharing Ergodicity and more] || [https://drive.google.com/file/d/1lNSmc_qQtopldlzp03yVfos_T5ftVXg1/view?usp=sharing Preview Problems 7] | ||
|- | |- | ||
| − | | U2 || 9/20 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) & Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]<br/> and [https://wustl.instructure.com/courses/ | + | | U2 || 9/20 || Review of ''z''-transforms and applications to DTMCs || Chapter 25 (the parts about ''z''-transforms) & Chapter 10 (mostly Section 10.3, though the others are of independent interest) || [https://drive.google.com/file/d/1K8ZseWalrb4qKkYT65oqKGwxuS2cEk29/view?usp=sharing ''z''-transforms]<br/> and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit ''z''-transform solution for Geom/Geom/1 queue (last problem of U2 on Canvas)] || [https://drive.google.com/file/d/1salKxToOMFogF_rJ3TSanWoYPKAknaYW/view?usp=sharing Preview Problems 8] || |
|- | |- | ||
| Open || 9/25 || U2 Recap session || All U2 material || [https://drive.google.com/file/d/1-sXzwvrUJvF6KQ9JgOUkpxjg-vaUdXNV/view?usp=sharing Review 1] || ||style="background-color: SkyBlue;"|[https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2] | | Open || 9/25 || U2 Recap session || All U2 material || [https://drive.google.com/file/d/1-sXzwvrUJvF6KQ9JgOUkpxjg-vaUdXNV/view?usp=sharing Review 1] || ||style="background-color: SkyBlue;"|[https://drive.google.com/file/d/156Nej3kd8R8M5hgwy6C7BQBF3Ttw1vZg/view?usp=sharing HWK #2] | ||
| Line 121: | Line 121: | ||
! Quizzes & Homeworks | ! Quizzes & Homeworks | ||
|- | |- | ||
| − | | U3 || 10/2 ||Introduction to continuous time Markov chains (CTMC), M/M/1 queue & PASTA theorem || Chapters 12 & 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1N_FjkEftjkBNqMCpMKAJ-VgpU1awAjNH/edit?usp=sharing Exponential & Poisson Distributions] (for PASTA), and [https://wustl.instructure.com/courses/ | + | | U3 || 10/2 ||Introduction to continuous time Markov chains (CTMC), M/M/1 queue & PASTA theorem || Chapters 12 & 13 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] plus [https://drive.google.com/file/d/1N_FjkEftjkBNqMCpMKAJ-VgpU1awAjNH/edit?usp=sharing Exponential & Poisson Distributions] (for PASTA), and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit and some related problems (Chapter 13 problems in U3)]] || [https://drive.google.com/file/d/1temAdHNjumrKtWOhsyhaOZWO5P1KMgRv/view?usp=sharing Preview Problems 10] || |
|- | |- | ||
| U3 || 10/4 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1V2DdMTX-VmHPxh6-OeSO5d-MSa2xOXPS/view?usp=sharing/view?usp=sharing Preview Problems 11] || | | U3 || 10/4 || M/M/k/k (Erlang-B formula) and M/M/k queueing systems || Chapter 14 || [https://drive.google.com/file/d/1otmURHW2OSvYLVTYL6BwxbfSETV2XgS8/view?usp=sharing Continuous Time Markov Chains] || [https://drive.google.com/file/d/1V2DdMTX-VmHPxh6-OeSO5d-MSa2xOXPS/view?usp=sharing/view?usp=sharing Preview Problems 11] || | ||
| Line 131: | Line 131: | ||
| U4 || 10/16 ||Revisiting time reversibility and applications to network of queues || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Burke Theorem, Reversibility, and Basic Networks of Queues] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13] ||style="background-color: SpringGreen;"| Quiz 3 | | U4 || 10/16 ||Revisiting time reversibility and applications to network of queues || Chapter 16 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Burke Theorem, Reversibility, and Basic Networks of Queues] || [https://drive.google.com/file/d/17fu4zcO2_Z8HshFDPyDbD9XK0RTupujm/view?usp=sharing Preview Problems 13] ||style="background-color: SpringGreen;"| Quiz 3 | ||
|- | |- | ||
| − | | U4 || 10/18 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Jackson Networks of Queues] <br/> and [https://wustl.instructure.com/courses/ | + | | U4 || 10/18 || Jackson networks (of queues) and product form distribution || Chapter 17 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Jackson Networks of Queues] <br/> and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit Chapter 17 problem (1st problem in U4)] || [https://drive.google.com/file/d/138JHM-v3nsl6_bc7XQ_xP--KgU1s5SS2/view?usp=sharing Preview problems 14] || |
|- | |- | ||
| − | | U4 || 10/23 || Classed Jackson networks + Mean Value Analysis || Chapters 18 & 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Classed Networks of Queues & Mean Value Analysis] <br/> and [https://wustl.instructure.com/courses/ | + | | U4 || 10/23 || Classed Jackson networks + Mean Value Analysis || Chapters 18 & 19 || [https://drive.google.com/file/d/1FYodvmJhjSJpH-A0EBBbpKXZCNfASfyA/view?usp=sharing Classed Networks of Queues & Mean Value Analysis] <br/> and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit Chapter 18 problem (2nd problem in U4)] || [https://drive.google.com/file/d/1_PkhpN7ZFv-b-SFJ5v66WORU6kc7NplB/view?usp=sharing Preview Problems 15] || |
|- | |- | ||
| Open || 10/25 || U4 Recap session || All U4 material || [https://drive.google.com/file/d/1Nh7sTlNtEV5fHZnQYYJOHT7nWarSZfJd/view?usp=sharing Review 3] || ||style="background-color: SkyBlue;"| [https://drive.google.com/file/d/1bAWQ8ge6oFyXWyQmbdl9AkyQ297VLcIF/view?usp=sharing HWK #4] | | Open || 10/25 || U4 Recap session || All U4 material || [https://drive.google.com/file/d/1Nh7sTlNtEV5fHZnQYYJOHT7nWarSZfJd/view?usp=sharing Review 3] || ||style="background-color: SkyBlue;"| [https://drive.google.com/file/d/1bAWQ8ge6oFyXWyQmbdl9AkyQ297VLcIF/view?usp=sharing HWK #4] | ||
| Line 154: | Line 154: | ||
| U5 || 11/1 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Processor Sharing Queues] || [https://drive.google.com/file/d/1xk1aBP_OvY7-PPkWCzz8CiUs0OK-7mQG/view?usp=sharing Preview Problems 17] || | | U5 || 11/1 || Processor sharing queues || Chapter 22 || [https://drive.google.com/file/d/1b8Pv7Tn3A9aW4cxJlFIB7XKJErzINjeS/view?usp=sharing Processor Sharing Queues] || [https://drive.google.com/file/d/1xk1aBP_OvY7-PPkWCzz8CiUs0OK-7mQG/view?usp=sharing Preview Problems 17] || | ||
|- | |- | ||
| − | | U5 || 11/6 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing M/G/1 Queue & Renewal Reward Theory] <br/> and [https://wustl.instructure.com/courses/ | + | | U5 || 11/6 || The M/G/1 queue and Renewal-Reward theorem || Chapter 23 || [https://drive.google.com/file/d/1aK0ermvVpXg-Iu30VeASU7Mv2WQ1ZsDt/view?usp=sharing M/G/1 Queue & Renewal Reward Theory] <br/> and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit Chapter 23 problems (1st problems in U5a)] || [https://drive.google.com/file/d/1t0xEehTn1H0vcJ-4aTderT8ScBSFyWyv/view?usp=sharing Preview Problems 18] || |
|- | |- | ||
| U5 || 11/8 || A brief foray into task/server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Task/Server Assignment Policies] || [https://drive.google.com/file/d/14WecX4jpQg1-m2r7s0VOlvskzDJAsmwc/view?usp=sharing Preview Problems 19] || | | U5 || 11/8 || A brief foray into task/server assignment policies || Chapter 24 || [https://drive.google.com/file/d/1rsExWMVcJSD2kVdwW-RmPkeR0GHFQ-ca/view?usp=sharing Task/Server Assignment Policies] || [https://drive.google.com/file/d/14WecX4jpQg1-m2r7s0VOlvskzDJAsmwc/view?usp=sharing Preview Problems 19] || | ||
| Line 162: | Line 162: | ||
| U5 || 11/15 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Transform Analysis]<br/> and [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/1S1fZ7bzl-o78DQkdX0tMxkVUi-Y-JXOi/view?usp=sharing Preview Problems 20] ||style="background-color: SpringGreen;"| Quiz 5 | | U5 || 11/15 || Transform analysis of M/G/1 queue (and review of transforms) || Chapter 25 and Chapter 26 (Section 1) || [https://drive.google.com/file/d/16lTll0lXbyOJltQ_ERLkj2dYz7vvFGk5/view?usp=sharing Transform Analysis]<br/> and [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/1S1fZ7bzl-o78DQkdX0tMxkVUi-Y-JXOi/view?usp=sharing Preview Problems 20] ||style="background-color: SpringGreen;"| Quiz 5 | ||
|- | |- | ||
| − | | U5 || 11/20 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing M/G/1 Busy Period & Power Optimization] <br/> and [https://wustl.instructure.com/courses/ | + | | U5 || 11/20 || M/G/1 queue and application to power optimization || Chapter 26 (Section 2) and Chapter 27 || [https://drive.google.com/file/d/1h8hNRPr9CUfIBKlUt9PLf_n_5NbBMPyJ/view?usp=sharing M/G/1 Busy Period & Power Optimization] <br/> and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit Chapter 27 problems (2nd problems in U5a)] || [https://drive.google.com/file/d/1GFA5hAAEp5jB1u-QVRIIxOP0WEfRDENr/view?usp=sharing Preview Problems 21] || |
|- | |- | ||
|style="background-color: Red;"| ||style="background-color: Red;"| 11/22 ||colspan="5" style="background-color: Red; text-align:center;"| NO CLASS - THANKSGIVING BREAK | |style="background-color: Red;"| ||style="background-color: Red;"| 11/22 ||colspan="5" style="background-color: Red; text-align:center;"| NO CLASS - THANKSGIVING BREAK | ||
|- | |- | ||
| − | | U5 || 11/27 || Non-preemptive scheduling policies for M/G/1/ queue || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Scheduling Non-Preemptive Policies] <!-- <br/> and [https://wustl.instructure.com/courses/ | + | | U5 || 11/27 || Non-preemptive scheduling policies for M/G/1/ queue || Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 ||[https://drive.google.com/file/d/14rnLhfI0ijR8ht4ygVWnqZD8JtOBTRjP/view?usp=sharing Scheduling Non-Preemptive Policies] <!-- <br/> and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit LCFS problem] --> || [https://drive.google.com/file/d/1UeWHltFZQnZbLNQskeBHAOUq7Cl-SiI-/view?usp=sharing Preview Problems 22]|| |
|- | |- | ||
| − | | U5 || 11/29 || Non-Size-Based Preemptive scheduling policies for M/G/1 queue || Chapter 30 ||[https://drive.google.com/file/d/1Af2GKXJB83TV_DduVbjk_PXajM8pQPns/edit?usp=share_link&ouid=112223552596975457559&rtpof=true&sd=true Non-Size-Based Preemptive Scheduling Policies] <br/> and [https://wustl.instructure.com/courses/ | + | | U5 || 11/29 || Non-Size-Based Preemptive scheduling policies for M/G/1 queue || Chapter 30 ||[https://drive.google.com/file/d/1Af2GKXJB83TV_DduVbjk_PXajM8pQPns/edit?usp=share_link&ouid=112223552596975457559&rtpof=true&sd=true Non-Size-Based Preemptive Scheduling Policies] <br/> and [https://wustl.instructure.com/courses/133964/pages/practice-problems-by-unit Problem 30.5 (3rd problem in U5b)] || [https://drive.google.com/file/d/15U9XpFDi7HiAqiMqt_9yR4d_eS1IRh8V/view?usp=sharing Preview Problems 23] || |
|} | |} | ||
Revision as of 23:00, 1 May 2024
Contents
Syllabus & Schedule (Fall 2024)
THE INFORMATION ON THIS WIKI PAGE MAY BE UPDATED THROUGHOUT THE SEMESTER. PLEASE CHECK IT REGULARLY
Schedule at-a-glance
Class times and location: Monday & Wednesday, 4:00pm-5:20pm in TBA0.
Legend: date (quizzes) and due date (homeworks)
| Quiz | Hmwk | No class |
|---|---|---|
| Mo. | We. | Mo. | We. | Mo. | We. | Mo. | We. | Mo. | We. | |
|---|---|---|---|---|---|---|---|---|---|---|
| August | 26 | 28 | ||||||||
| September | 2 | 4 | 9 (H1) | 11 (Q1) | 16 | 18 | 23 (H2) | 25 (Q2) | 30 | |
| October | 2 | 7 | 9 (H3) | 14 (Q3) | 16 | 21 | 23 (H4) | 28 (Q4) | 30 | |
| November | 4 | 6 | 11 (H5) | 13 (Q5) | 18 | 23 | 25 | 27 | ||
| December | 2 | 4 (H6) | ||||||||
| 5 (Q6) | Note: To be completed by 5:30pm on the last day of classes, Friday, December 6, 2024 | |||||||||
Zoom access of live lectures WHEN OFFERED (see Zoom & Video Access) will be through Canvas
Detailed Schedule & Syllabus
NOTE: This schedule in TENTATIVE, and may change depending on the speed at which we cover different topics. Changes to the schedule will be reflected as quickly as possible on this page.
August
| Unit | Date | Scope | Material & Reading Assignments
(To Be Read Ahead of Class) |
Notes & slides
(If any) |
Preview Problems | Quizzes & Homeworks |
|---|---|---|---|---|---|---|
| U0 | 8/28 | Course overview, logistics, (motivating) examples and terminology | Chapters 1 & 2 | Notes 0 Intro & Nomenclature |
Preview Problems 1 | |
| U1 | 8/30 | A brief review of probability topics, both basic and slightly more advanced, which are needed in the course | Chapters 3 & 5 | Probability Refresher and Practice Problems for U1 | Preview Problems 2 |
September
| Unit | Date | Scope | Material & Reading Assignments
(To Be Read Ahead of Class) |
Notes & slides
(If any) |
Preview Problems | Quizzes & Homeworks |
|---|---|---|---|---|---|---|
| U1 | 9/4 | NO CLASS - LABOR DAY | ||||
| 9/6 | An introduction of general principles such as Little's Law and various other "laws" and bounds for closed system, which hold with little or no assumptions | Chapters 6 & 7 | Little & Operational Laws | Preview Problems 3 & 4 | ||
| U2 | 9/11 | A first foray into Markov chain focused on finite Discrete Time Markov Chains (DTMCs) and their applications to simple problems. | Chapter 8 (Sections 8.1 to 8.7) | Discrete Time Markov Chains and Web caching as a DTMC in U2 Practice Problems |
Preview Problems 5] | HWK #1 |
| U2 | 9/13 | Infinite DTMCs and some simple applications | Chapter 8 (Sections 8.8 to 8.10) | Discrete Time Markov Chains and DTMC Examples |
Preview Problems 6 | Quiz 1 |
| U2 | 9/18 | Ergodicity, balance equations, and time reversibility for DTMCs | Chapter 9 | Ergodicity and more | Preview Problems 7 | |
| U2 | 9/20 | Review of z-transforms and applications to DTMCs | Chapter 25 (the parts about z-transforms) & Chapter 10 (mostly Section 10.3, though the others are of independent interest) | z-transforms and z-transform solution for Geom/Geom/1 queue (last problem of U2 on Canvas) |
Preview Problems 8 | |
| Open | 9/25 | U2 Recap session | All U2 material | Review 1 | HWK #2 | |
| U3 | 9/27 | Exponential distribution & Poisson process | Chapter 11 | Exponential & Poisson Distributions (except the material on PASTA) | Preview Problems 9 | Quiz 2 |
October
| Unit | Date | Scope | Material & Reading Assignments
(To Be Read Ahead of Class) |
Notes & slides
(If any) |
Preview Problems | Quizzes & Homeworks |
|---|---|---|---|---|---|---|
| U3 | 10/2 | Introduction to continuous time Markov chains (CTMC), M/M/1 queue & PASTA theorem | Chapters 12 & 13 | Continuous Time Markov Chains plus Exponential & Poisson Distributions (for PASTA), and and some related problems (Chapter 13 problems in U3)] | Preview Problems 10 | |
| U3 | 10/4 | M/M/k/k (Erlang-B formula) and M/M/k queueing systems | Chapter 14 | Continuous Time Markov Chains | Preview Problems 11 | |
| 10/9 | NO CLASS - FALL BREAK - Review 2 to be held in TBD on TBD Slides for review 2 | |||||
| U3 | 10/11 | Applications to system provisioning | Chapter 15 + Sections 8.11 & 8.12 of Zukerman's book (Hayward approximation and Equivalent Random Theory) | System Provisioning | Preview Problems 12 | HWK #3 |
| U4 | 10/16 | Revisiting time reversibility and applications to network of queues | Chapter 16 | Burke Theorem, Reversibility, and Basic Networks of Queues | Preview Problems 13 | Quiz 3 |
| U4 | 10/18 | Jackson networks (of queues) and product form distribution | Chapter 17 | Jackson Networks of Queues and Chapter 17 problem (1st problem in U4) |
Preview problems 14 | |
| U4 | 10/23 | Classed Jackson networks + Mean Value Analysis | Chapters 18 & 19 | Classed Networks of Queues & Mean Value Analysis and Chapter 18 problem (2nd problem in U4) |
Preview Problems 15 | |
| Open | 10/25 | U4 Recap session | All U4 material | Review 3 | HWK #4 | |
| U5 | 10/30 | A quick introduction to Matrix-Analytic techniques and phase-type distributions | Chapter 21 | Matrix Analytic Techniques | Preview Problems 16 | Quiz 4 |
November
| Unit | Date | Scope | Material & Reading Assignments
(To Be Read Ahead of Class) |
Notes & slides
(If any) |
Preview Problems | Quizzes & Homeworks |
|---|---|---|---|---|---|---|
| U5 | 11/1 | Processor sharing queues | Chapter 22 | Processor Sharing Queues | Preview Problems 17 | |
| U5 | 11/6 | The M/G/1 queue and Renewal-Reward theorem | Chapter 23 | M/G/1 Queue & Renewal Reward Theory and Chapter 23 problems (1st problems in U5a) |
Preview Problems 18 | |
| U5 | 11/8 | A brief foray into task/server assignment policies | Chapter 24 | Task/Server Assignment Policies | Preview Problems 19 | |
| Open | 11/13 | U5 Recap session | All U5 material covered so far | Review 4 | HWK #5 | |
| U5 | 11/15 | Transform analysis of M/G/1 queue (and review of transforms) | Chapter 25 and Chapter 26 (Section 1) | Transform Analysis and Summary of Main Transform Relationships |
Preview Problems 20 | Quiz 5 |
| U5 | 11/20 | M/G/1 queue and application to power optimization | Chapter 26 (Section 2) and Chapter 27 | M/G/1 Busy Period & Power Optimization and Chapter 27 problems (2nd problems in U5a) |
Preview Problems 21 | |
| 11/22 | NO CLASS - THANKSGIVING BREAK | |||||
| U5 | 11/27 | Non-preemptive scheduling policies for M/G/1/ queue | Review Section 3 of Chapter 27, Chapter 29 and Chapter 31 | Scheduling Non-Preemptive Policies | Preview Problems 22 | |
| U5 | 11/29 | Non-Size-Based Preemptive scheduling policies for M/G/1 queue | Chapter 30 | Non-Size-Based Preemptive Scheduling Policies and Problem 30.5 (3rd problem in U5b) |
Preview Problems 23 | |
December
| Unit | Date | Scope | Material & Reading Assignments
(To Be Read Ahead of Class) |
Notes & slides
(If any) |
Preview Problems | Quizzes & Homeworks |
|---|---|---|---|---|---|---|
| U5 | 12/4 | Size-Based Preemptive scheduling policies for M/G/1 queue | Chapters 32 & 33 | Size-Based Preemptive Policies | Preview Problems 24 | |
| Open | 12/6 | U5 Recap session | All U5 material covered from Quiz 5 onward | Review 5 Jiaming's review slides |
HWK #6 | |
| 12/7 | Available on 12/7 at 5:30pm, due three days later | Quiz 6 | ||||
