Homeworks
- Homework 1 -- Probability Review -- Due Sept 8
- For problem 2.2: you should think of T as the response time for an arbitrary job; S as the size of that job; and Slow as the slowdown of that job. You are looking for E[Slow] = E[T/S] for this arbitrary job. Clearly the job's response time and its size are *not* independent. However there are other quantities that *are* independent for the job.
- For problem 3.67 : First make sure that you've read the undergraduate probability text and understand how to solve P{Both boys | At least one boy}. That's the approach you should be thinking about, but now with more categories.
- Homework 2 -- Convergence, z-transforms, Operational Laws -- Due Sept 15
- You are free to skip writing up ONE problem of your choosing. You *MUST* indicate clearly on your homework WHICH problem you are choosing to skip and not have graded. If you do not indicate the problem, we will assume that you're skipping the last problem and will not grade that one.
- Homework 3 -- More Operational Laws -- Due Sept 22
- Homework 4 -- DTMCs -- Due Sept 29
- Homework 5 -- Ergodicity -- Due Oct 6
- Note: There are only 7 problems here, and you get to skip one, so only 6 this time.
- If you want more practice, you can try 9.9 and/or 25.10 in your textbook.
- For problem 10.7 part f : You'll find that after you simplify the partial fraction decomposition, one of the terms will end up being 0. This will make your answer a lot nicer!
- Homework 6 -- Exponentials and Poisson Process -- Due WEDNESDAY Oct 11, at start of class
- Exercise 11.11 has two added parts.
- Homework 7 -- from M/M/1 to M/M/k -- Due Oct 27, at start of class
- Homework 8 -- M/M/k, Burke, and Jackson -- Due Nov 3, at start of class
- Homework 9 -- Classed Jackson and General Distributions -- Due Nov 10, at start of class
- Homework 10 -- M/G/1 and Renewal-Reward -- Due Nov 17, at start of class
- When doing Renewal-Reward problems, please clearly specify the relevant parameters, such as: how you're defining the renewal cycle, what is the rate at which reward is being earned, what is the total reward in each cycle, etc.
- Homework 11 -- M/G/1 and Busy Periods -- Due Wednesday Nov 29, at start of class
- No late minutes on this homework -- solutions going out in Wednesday's class.
- I apologize: We're not getting to Chpt 30 in time for this homework. Please move Exercise 30.5 to HW 12. You can still skip one problem of your choice on HW 11.
- Exercise 27.1: Assume that E[S] = 1/mu, i.e. mu and E[S] are reciprocals.
- Exercise 27.3: It helps to follow the same process that we used in class for deriving the Laplace transform of a busy period, where we first derive the Laplace transform of B(x) and then use that to derive the Laplace transform of B. This time, however, you are deriving the Laplace transform of B_{short}(x) and B_{short}, where the "short" indicates that only short jobs are allowed.
- Exercise 26.5: Remember that you're using Distributional Little's Law as defined in class. This is the one that relates N_Q(z) to A_{T_Q}(z) to T_Q(s). See my lecture on Chpt 27!
- Exercise 26.11 -- Go back and look at Exercise 25.7 and use that interpretation. This is only a few lines of argument (no math).
- Homework 12 -- Scheduling -- Due Wednesday Dec 6, at start of class
- Exercise 30.3: HINT: Think about the CTMC for the M/M/1 with different scheduling policies.
Class Topics/Relevant Papers
Papers are totally optional reading. You're only responsible for the book reading.
- Mon, Aug 28, Chpt 1: Motivating Examples on Queueing Theory. (Mor)
- Wed, Aug 30, Chpt 2: Queueing Theory Notation/Vocabulary. (Mor)
- Fri, Sept 1, Chpt 4: Simulating Random Variables. (Jalani)
- Mon, Sept 4, LABOR DAY, No Class.
- Wed, Sept 6, Chpt 5: Convergence of Random Variables and Time Average versus Ensemble Average (Mor)
- Fri, Sept 8, Chpt 25 -- z-transforms only plus exercises on z-transforms (Jalani)
- Mon, Sept 11, Chpt 6: Operational Laws, Little's Law (Mor)
- Wed, Sept 13, Chpt 7: Modification Analysis (Mor)
- Fri, Sept 15, Chpt 7: Modification Analysis (Jalani)
- Mon, Sept 18, Chpt 8: Discrete-Time Markov Chains (Mor)
- Wed, Sept 20, Chpt 9: Ergodicity Theory (Mor)
- Fri, Sept 22: No class -- turn in HW by 2 p.m. at Mor's office: CHG 7207
- Mon, Sept 25, Chpt 9: Ergodicity Theory (Mor)
- Wed, Sept 27, Chpt 9: Ergodicity Theory -- Infinite-state DTMCs (Mor)
- Fri, Sept 29, Chpt 11: Chpt 25: Laplace Transforms (Jalani)
- Mon, Oct 2, Chpt 11: Exponential Distribution leading to Poisson Process (Mor)
- Wed, Oct 4, Chpt 11 cont: Poisson Process (Mor)
- Fri, Oct 6, Chpt 12: Conversion to M/M/1 (Jalani)
- Mon, Oct 9, Chpt 13: M/M/1 (Mor)
- Wed, Oct 11, Chpt 14: M/M/k (Mor)
- THURS -- Oct 12 -- MIDTERM 1
- Fri, Oct 13 -- Midterm 1 review (Jalani)
- WEEK OF OCT 16: CMU BREAK
- Mon, Oct 23: Chpt 15: Square Root Staffing (Jalani)
- Wed, Oct 25, Chpt 16: Burke's Thm (Mor)
- Fri, Oct 27, Chpt 17: Jackson Networks (Mor)
- Mon, Oct 30, Chpt 18: Classed Jackson Networks (Mor)
- Wed, Nov 1, "Open Problems in CTMCs" + Chpt 20: Pareto (Mor)
- Fri, Nov 3, Chpt 21: Phase-type Distributions (Jalani)
- Mon, Nov 6, Chpt 23: Renewal Reward (Mor)
- Wed, Nov 8, Chpt 23 cont., chpt 24: Task Assignment (Mor)
- Fri, Nov 10, Chpt 26
- Mon, Nov 13, Chpt 27
- Wed, Nov 15 -- NO CLASS (Away at conference)
- Fri, Nov 17 -- NO CLASS (Jalani and Mor are both away)
- Mon, Nov 20 Chpt 28, 29 : Scheduling
- Wed, Nov 22 -- NO CLASS -- THANKSGIVING
- Fri, Nov 24 -- NO CLASS -- THANKSGIVING
- Mon, Nov 27: Chpt 31: Scheduling (Mor)
- Wed, Nov 29: Chpt 30: Scheduling (Mor)
- Fri, Dec 1: Chpt 30/32: Scheduling (Mor)
- Mon, Dec 3: Chpt 32: Scheduling (Mor)
- Wed, Dec 5: Chpt 33: Scheduling (Mor)
- Thurs, Dec 6 -- MIDTERM 2
- Fri, Dec 8 -- Entirely Optional -- Just a chance to go over questions related to the exam (Jalani)