Homework1: Due Wednesday Sept 22 at start of class: 2.1, 2.2, 2.3, 3.3, 3.5, 3.6, 3.8, 3.10

Homework2: Due Wednesday Sept 29 at start of class: 3.11, 3.12, 3.14, 3.16, 5.1, 6.3, 6.4, 6.6

Homework3: Due Wednesday Oct 5 at start of class: 3.7, 4.1, 7.1, 7.3, 7.4, 7.5, 8.1, 8.2, 8.6

Homework4: Due Wednesday Oct 12 at start of class: 8.5, 9.1, 9.5, 9.7, 9.8

Homework5: Due Wednesday Oct 19 at start of class: 9.2, 9.3, 9.4, 10.2, 10.3, 12.1, 12.2, 12.3, 12.4, 12.5, 12.6 (Note: There's a sentence missing in 9.4. See this revision:
** Revised prob 9.4 ** )

MIDTERM 1: OCT 26: 10:30 a.m. - 12:20 p.m. You can bring a 3x5 index card.

Homework6: Due Wednesday Nov 2 at start of class: 14.1, 14.2, 14.3, 14.4, 14.5, 14.6, 15.1, 15.3, 15.7, 15.9, 16.5, 26.4 (Note that 26.4 was added later, replacing 16.4).

Homework7: Due Wednesday Nov 9 at start of class: 26.5, 26.7, 18.1, 18.2, 16.1, 16.3, 16.4.

Homework8: Due Wednesday Nov 16 at start of class: 19.1, 19.2, 19.3, 19.4, 20.1, 21.2, 21.3, 22.4.

Homework9: Due Monday Nov 28 by 6 p.m. at Anshul's Office: Gates 7010: 22.2, 23.1, 24.2, 24.3, 24.5, 24.8, 26.8, 26.12, 25.4. Also do ONE of the following two choices: EITHER (i) 22.7 (parts a,c,e only) OR (ii) both 22.3 and 22.8.
EXTRA CREDIT: 24.9
Note: Some of these problems do not exist in the book, so please use these: ** HW9 problems **

Homework10: Due Wednesday Dec 7 at start of class: You can SKIP any one problem. Please mark the skipped problem: 27.2, 28.2, 28.3, 28.4, 30.1, 31.1, 31.2, 31.3, 31.4 (a,b,c).
Here's a mathematica file that will help you a lot in the problems from chpt 31: ** MathematicaFile **

EXTRA CREDIT: 28.5, 28.6, 28.7.

MIDTERM 2: DEC 12: 10:30 a.m. - 12:30 p.m. You can bring a 3x5 index card.

- Prof. Mor Harchol-Balter OFFICE HOURS: MW 12-1 p.m. plus F 1-2 p.m. in Gates 7207, Phone: x8-7893.
- TA: Anshul Gandhi OFFICE HOURS: T 3-4 p.m. in Gates 7010, Phone: x8-4973.

Topics covered include:

- Operational Laws: Little's Law, response-time law, asymptotic bounds, modification analysis, performance metrics;
- Markov Chain Theory: discrete-time Markov chains, continuous-time Markov chains, renewal theory, time-reversibility; Poisson Process: memorylessness, Bernoulli splitting, uniformity, PASTA;
- Queueing Theory: open networks, closed networks, time-reversibility, Renewal-Reward, M/M/1, M/M/k, M/M/k/k, Burke's theorem, Jackson networks, classed networks, load-dependent servers, BCMP result and proof, M/G/1 full analysis, M/G/k, G/G/1, transform analysis (Laplace and z-transforms);
- Simulations: time averages versus ensemble averages, generating random variables for simulation, Inspection Paradox;
- Modeling Empirical Workloads: heavy-tailed property, Pareto distributions, heavy-tailed distributions, understanding variability and tail behavior, Matrix-analytic methods;
- Management of Server Farms: capacity provisioning, dynamic power management, routing policies;
- Analysis of Scheduling: FCFS, non-preemptive priorities, preemptive priorities, PS, LCFS, FB, SJF, PSJF, SRPT, etc.

The techniques studied in this class are useful to students in
Computer Science, ECE, Mathematics, ACO, Tepper, Statistics, MLD, and Engineering.
This course is packed with * open problems *-- problems which if solved
are not just interesting theoretically, but which have huge
applicability to the design of computer systems today.

For a more detailed description see the
** Table of Contents ** of the book.

- Weekly Homeworks -- worth 45% total.
- Midterm 1 -- 20%.
- Midterm 2 -- 20% (no cumulative final).
- One grading meeting during semester -- 10%.
- Class participation -- 5%.