15-857: Analytical Performance Modeling & Design of Computer Systems

12 Units. Cross-listed with Tepper: 47-774 and 47-775.

Classes: M,W 1:30 p.m. - 2:50 p.m., Room: GHC 4307

Recitation: F 1:30 p.m. - 2:50 p.m., Room: GHC 4307


Important: Probability is a Prerequisite for this class. You should have received a pdf with some background chapters on probability from me, which you are responsible for.

Your TAs are generously holdng some probability review sessions:

We will closely follow my textbook Performance Modeling and Design of Computer Systems .



Please use OFFICE HOURS to ask technical questions, rather than asking these via email.



In designing computer systems one is usually constrained by certain performance requirements and limitations. For example, one might need to guarantee a response time SLA or certain throughput requirement, while at the same time staying within a power budget or cost budget. On the other hand, one often has many choices: One fast disk, or two slow ones? More memory, or a faster processor? A fair scheduler or one that minimizes mean response time? For multi-server systems, one can choose from a wide array of load balancing policies, a wide array of migration policies, capacity provisioning schemes, power management policies ... The possibilities are endless. The best choices are often counter-intuitive. Ideally, one would like to have answers to these questions before investing the time and money to build a system. This class will introduce students to analytic stochastic modeling with the aim of answering the above questions.

Topics covered include:

Throughout, the theory developed will be applied to a wide array of computer systems design problems including the design of efficient data centers, web servers, DBMS, disks, call centers, routers, and supercomputer centers.

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.


We assume a reasonable background in probability, such as that covered in an Undergraduate Probability class. Specifically, we assumes a knowledge of continuous and discrete distributions, conditional probability, conditional expectation, and higher moments. All the assumed material can be found in Chapter 3 of our textbook. Alternatively, you can read Chpts 2 through 7 of the Undergraduate Probability Notes, in the "Probability for Computing" text that was mailed to you. We also expect you to know basic calculus and nested integrals, as are covered in Chpt 2 of the "Probability for Computing" text. There is an assessment provided on the first day of class to make it clear to you if you have the prerequisites with respect to undergraduate probability and calculus.



You will receive regular homework problems. These will be difficult. Start immediately so that you can take full advantage of office hours. You will find office hours very helpful! Some of these homework problems will be repeated from previous years. The reason is that I have made up all the problems myself and it takes a very long time to think up good problems. Do not ask people who took this course in previous years to help you with the homeworks. This is considered cheating and will be reported to the dean. On the other hand, I strongly encourage you to collaborate with your current classmates to solve the homework problems after you have tried solving them by yourself. Each person must turn in a separate writeup. You should note on your homework specifically which problems were a collaborative effort and with whom.


In addition to the textbook for the class, there are additional sources available on this Booklist that you can borrow from my office: BOOK LIST.


Prior course evaluations average 4.8/5.0. To see all FCEs for the instructor Click Here .